Abstract families of deterministic languages

DOI10.1145/800169.805418zbMath1282.68153OpenAlexW1978349975MaRDI QIDQ5402502

W. J. Chandler

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.805418

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Characterizations of transductions defined by abstract families of transducers ⋮ Unnamed Item ⋮ One-way acceptors and languages ⋮ On inverse deterministic pushdown transductions ⋮ Opérations de cylindre et applications séquentielles gauches inverses ⋮ A characterization of two-way deterministic classes of languages ⋮ LR-regular grammars - an extension of LR(k) grammars ⋮ Characterizations and computational complexity of systolic trellis automata