Properties of deterministic top down grammars

DOI10.1145/800169.805431zbMath1282.68150OpenAlexW2016601857MaRDI QIDQ5402516

Richard E. Stearns, Daniel J. Rosenkrantz

Publication date: 14 March 2014

Published in: Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800169.805431

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

A note on top-down deterministic languages ⋮ Bounded query machines: on NP( ) and NPQUERY( )