Ask
Login
0
4.2kviews
Construct a PDA accepting the following language :
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 3.5 years ago

$L = {a^nb^ma^n / m,n>=1}$
theory of computation
ADD COMMENT EDIT
1 Answer
0
47views
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k

  • A PDA is defined as a 7-tuple representation such as

    (Q, є, δ, $q_0$, $z_0$,F,Γ)

    where

    1. Q – Finite set of states
    2. є- Input symbol
    3. δ- Transition function
    4. $q_0$ - Initial state
    5. $z_0$ – Bottom of the stack
    6. F- Set of final states
    7. Γ- Stack alphabet

  • Here, we have $a^n$ …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.