Skip to main content

Theory of Computation | Symbols, Alphabets, Strings and Language

Theory of computation or Automata theory mainly deals with abstract modeling of machines and computation. These models embody some of the important complex logical features we encounter, on dealing software as hardware.

The following are the basic terminologies, which are frequently used in Theory of Computation


The smallest building entity of Automata Theory( or Theory of Computation) is known as symbol.

example: a, 2, i, B...


A set of symbols forms an alphabet.

An alphabet is usually represented by Greek letter sigma( Σ )

example: Σ= { x, y}


A string is a sequence of symbols in a alphabet.

example: 'xy' is a string derived from the alphabet Σ= { x, y}


Collection of strings are called as a language.

example: Let an alphabet Σ= { p, q, r}

Then if a language L of set of a strings of length 2 over Σ can be represented as

L = { pp, pq, pr, qp, qq, qr, rp, rq, rr }

Alphabet concatenation gives you set of all strings of length of as many you do concatenation.

Let Σ = { x, y }

Σ2 = Σ.Σ = { x, y }.{ x, y } = { xx, xy, yx, yy }

Star(*) operator over alphabet gives universal set of all concatenated sets.

Σ* = {ε} U Σ U Σ2 U Σ3... = {ε} U { x, y } U { xx, xy, yx, yy }...

where Σ0 = {ε} is an empty set

Consider the python program.


This piece of code get considers as combinations of strings in Theory of Computation or Automata Theory.

In order to validate, whether a certain string belongs to a language or not, we use different kinds of automata.

More over mere validation strings, automata are also used to validate a given set of language


Popular posts from this blog

Operating Systems | Scheduling Algorithms : Round Robin

Round RobinFeatures : Most popular algorithm of allPractically implementableImplementable with basic data structures like queueExtremely lesser starvationOptimum efficiency can be set by controlling time quantumThe round robin algorithm will continuously switch between processes if a process in CPU (under execution) exceeds a time limit set by OS called time quantum.Flow Chart :Scheduler allocated process to for execution.CPU starts monitoring the execution time right after from allocation.If the process completes its execution before exceeding time quantum, OS forwards the process to termination state.else, the processes gets preempted once the time quantum limit exceeded and if the process finished at this moment, OS moves the process to termination state, else it moves to ready queue and iterates over the whole process listed above.Example : Consider the following table of processes and calculate completion time, turn around time and waiting time using Round Robin algorithm.Assumpt…

Operating Systems | Scheduling Algorithms : SJF

Shortest Job First(SJF)SJF algorithm schedules the shortest job(low burst time) available on main memory at the time of context switching in ready state . It can be either preemptive or non-preemptive depending on the nature of scheduler.Since the SJF select the job which is shorted among available jobs on main memory, Non-preemptive SJF algorithm will have larger waiting time if a job with longer burst time get scheduled first. In short SJF is also vulnerable to Convoy EffectTo find shortest process among min-heap would be the best data structure to be usedExample : Consider the following table of processes and calculate completion time, turn around time and waiting time using SJF algorithm with the following assumptions. No preemption.No I/O request will be there from any process.Arrival time is relative to CPU on time.Process NumberATBT103222324442View Answer

The execution of processes can be visualized as follows : By analyzing above representation completion time, turn around ti…

Operating Systems | Concept of Process

Hard disk drive of the system in called primary memory and secondary memory is Random Access Memory(RAM). Either a program written in High Level Language(HLL) or a executable code generated by the sequence of works done by pre-processor, compiler and assembler, resides in secondary memory of the system. To start an execution, operating system allocates some space in the main memory, for the program to be executed and loads the program in the secondary memory to the allocated space. The piece of work which is loaded by the operating system to the main memory in order to execute program is called processEvery program loaded by operating system will create a focus boundary(or process body), a partitioned memory area where all memory requirements for the execution of program is satisfied.Variable which will not change its value through out life time of process is called static variable and variables which are globally accessible in a process known as global variable.Heap area is reserved f…