On the Parikh Membership Problem for FAs, PDAs, and CMs

DOI10.1007/978-3-319-04921-2_2zbMath1407.68257OpenAlexW2183075714MaRDI QIDQ5404899

Oscar H. Ibarra, Bala Ravikumar

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_2

zbMATH Keywords

CFGbounded languagereversal-bounded counterscounter machineChomsky normal formNFAParikh vector

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

\(M\)-equivalence of Parikh matrix over a ternary alphabet

This page was built for publication: On the Parikh Membership Problem for FAs, PDAs, and CMs