PDA for the language of anbnc2n in theory of automata

PDA for the language of anbnc2n in theory of automata

Accepted strings

Following strings must be accepted by PDA;

abcc, aabbcccc, aaabbbcccccc,…..etc.

Rejected strings

Following strings must be rejected by PDA;

abc, abccc, aabbcc, …….etc.

PDA examples

  List of All examples of Push Down Automata (PDA): Click Here .

Related Posts:

  1. Finite Automata | Finite State Machines | Deterministic FSM
  2. Push Down Automata - PDA
  3. Theory of Automata and Computation - Past (old)…
  4. Regular Expression for no 0 or many triples of 0s…
  5. Regular Expression for having strings of multiple…
  6. Regular Expression for strings having at least one…
  7. RE for exactly single 1 many 0’s |exactly single a many b
  8. Regular Expression in compiler construction
By: Prof. Fazal Rehman Shamil    CEO @ T4Tutorials
Whatsapp: +92 302 87 000 85     Facebook: For Discussions

Leave a Reply

Your email address will not be published. Required fields are marked *