On Bounded Languages and Reversal-Bounded Automata

DOI10.1007/978-3-642-37064-9_32zbMath1333.68167OpenAlexW177392600MaRDI QIDQ4910475

Oscar H. Ibarra, Bala Ravikumar

Publication date: 18 March 2013

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-642-37064-9_32

zbMATH Keywords

semilinear setcontext-free language (CFL)nondeterministic pushdown automaton (NPDA)reversal-boundedstratified linear set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

This page was built for publication: On Bounded Languages and Reversal-Bounded Automata