vu CS402 fall 2019 GDB
vu cs402 gdb solution
Task:
"Theory of automata is study of abstract machines, like Turing Machines,
Finite State Machines, Push Down Automata, Mealy and Moore Machines. You
have to discuss and explain which kind of automaton machine promisingly
can serve as a recognizer for context-free languages."
Solution:
Context Free languages (CFLs)
are languages that are recognized by Context Free Grammars,
i.e., grammars whose production rules are of the form N → (N ∪ Σ)⇤. They are
also languages that are recognized by a type
of machine called Pushdown automata.
Pushdown Automata (PDA) is the machine format of context
free language (CFL). It is one type of finite state machine (FSM) which is used
to accept only CFLs.
VU CS402 GDB solution
No comments:
Post a Comment