Prefix grammars: An alternative characterization of the regular languages
From MaRDI portal
Publication:1332773
DOI10.1016/0020-0190(94)00074-3zbMath0813.68125MaRDI QIDQ1332773
Michael Frazier, C. David jun. Page
Publication date: 5 September 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00074-3
Related Items
Multiple splicing systems and the universal computability, Derivation trees of ground term rewriting systems., Peg-solitaire, string rewriting systems and finite automata, LARS: a learning algorithm for rewriting systems, Complexity results for prefix grammars
Cites Work