Traces of term-automatic graphs

DOI10.1051/ita:2008018zbMath1149.68395OpenAlexW2144356038MaRDI QIDQ3526420

Antoine Meyer

Publication date: 25 September 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92891

zbMATH Keywords

formal languagesinfinite automatatiling systemsgraphs defined by term transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (2)

Rewriting Higher-Order Stack Trees ⋮ Rewriting higher-order stack trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Context-sensitive string languages and recognizable picture languages
• Families of automata characterizing context-sensitive languages
• Alternation
• One-sided and two-sided context in formal grammars
• Context-Sensitive Languages, Rational Graphs and Determinism
• Classes of languages and linear-bounded automata

This page was built for publication: Traces of term-automatic graphs