transition table

Regular Expression The language accepted by finite automata can be easily described by simple expressions called Regular Expressions. It is the most…

Ambiguity in Grammar A grammar is said to be ambiguous if there exists more than one leftmost derivation or more than one…

Chomsky Hierarchy Chomsky Hierarchy represents the class of languages that are accepted by the different machine. The category of language in Chomsky’s…

Eliminating ε Transitions NFA with ε can be converted to NFA without ε, and this NFA without ε can be converted to…

Finite Automata Finite automata are used to recognize patterns. It takes the string of symbol as input and changes its state accordingly.…

Greibach Normal Form (GNF) GNF stands for Greibach normal form. A CFG(context free grammar) is in GNF(Greibach normal form) if all the…

Language accepted by Turing machine The turing machine accepts all the language even though they are recursively enumerable. Recursive means repeating the…

Mealy Machine A Mealy machine is a machine in which output symbol depends upon the present input symbol and present state of…

NFA (Non-Deterministic finite automata) NFA stands for non-deterministic finite automata. It is easy to construct an NFA than DFA for a given…

Moore Machine Moore machine is a finite state machine in which the next state is decided by the current state and current…