An abstract machine theory for formal language parsers

From MaRDI portal

Revision as of 06:14, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:2561969

Jump to:navigation, search

DOI10.1007/BF00264037zbMath0265.68038MaRDI QIDQ2561969

David B. Benson

Publication date: 1974

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items (2)

Epimorphisms of free monoids ⋮ Bisimulation of automata

This page was built for publication: An abstract machine theory for formal language parsers

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