Context-Sensitive Languages, Rational Graphs and Determinism

DOI10.2168/LMCS-2(2:6)2006zbMath1126.68049MaRDI QIDQ5310659

Antoine Meyer, Arnaud Carayol

Publication date: 11 October 2007

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

formal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Linearly bounded infinite graphs ⋮ Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory ⋮ A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ Traces of term-automatic graphs ⋮ An Infinite Automaton Characterization of Double Exponential Time

This page was built for publication: Context-Sensitive Languages, Rational Graphs and Determinism