RACSO
DFA
CFG
Operations:
Reg
,
CF
PDA
Reductions:
K
,
WP
,
CFG
,
NP
,
SAT
ANTLR:
lexical
,
syntactic
Exams
log in
,
register
,
become guest
This site uses cookies only for the purpose of identifying user sessions. This is required to properly register actions.
Exercise
‹
14
›
:
PDA for
{
a
i
b
j
c
k
∣
i
=
j
∨
j
=
k
}
\{ a^i b^j c^k \mid i=j \vee j=k \}
{
a
i
b
j
c
k
∣
i
=
j
∨
j
=
k
}
Write a PDA (
which will be non-deterministic and non-uniquely-accepting
) recognizing the words of the form
a
i
b
j
c
k
a^i b^j c^k
a
i
b
j
c
k
with the same amount of
a
a
a
’s and
b
b
b
’s or the same amount of
b
b
b
’s and
c
c
c
’s.
Authors:
Guillem Godoy /
Documentation:
// Write your PDA here...
To be able to submit you need to either
log in
,
register
, or
become a guest
.