A Formalization of Transition Diagram Systems

DOI10.1145/321752.321756MaRDI QIDQ5674990zbMATH OpenOpenAlexFDO

Authors David Bruce Lomet

Publication date 1973

Published in Journal of the ACM (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(9)

• Deterministic grammars and grammar morphisms
• A pumping lemma for deterministic context-free languages
• On LLP(k) grammars and languages
• On the relationship between the LL(k) and LR(k) grammars
• Intercalation lemmas for tree transducer languages
• Normal forms of deterministic grammars
• Augmented transition networks and their relation to tree transducers
• Towards a Taxonomy for ECFG and RRPG Parsing
• Intersection and union hierarchies of deterministic context-free languages and pumping lemmas

This page was built for publication: A Formalization of Transition Diagram Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5674990)