A Formalization of Transition Diagram Systems

From MaRDI portal

Revision as of 04:28, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5674990

Jump to:navigation, search

DOI10.1145/321752.321756zbMath0259.68034OpenAlexW2084649503MaRDI QIDQ5674990

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)

Related Items (8)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5674990&oldid=30381049"