Traces of term-automatic graphs

DOI10.1051/ITA:2008018zbMATH Open1149.68395OpenAlexW2144356038MaRDI QIDQ3526420FDOQ3526420

Authors: 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

Recommendations

• Traces of Term-Automatic Graphs
• Families of automata characterizing context-sensitive languages
• The synchronized graphs trace the context-sensitive languages
• Context-Sensitive Languages, Rational Graphs and Determinism
• Mathematical Foundations of Computer Science 2005

zbMATH Keywords

formal languagestiling systemsgraphs defined by term transducersinfinite automata

Mathematics Subject Classification ID

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

Cites Work

• One-sided and two-sided context in formal grammars
• Title not available (Why is that?)
• Alternation
• Context-sensitive string languages and recognizable picture languages
• Classes of languages and linear-bounded automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Context-Sensitive Languages, Rational Graphs and Determinism
• Families of automata characterizing context-sensitive languages

Cited In (7)

• Title not available (Why is that?)
• Linearly bounded infinite graphs
• Traces of Term-Automatic Graphs
• Mathematical Foundations of Computer Science 2005
• The synchronized graphs trace the context-sensitive languages
• Rewriting higher-order stack trees
• Rewriting higher-order stack trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526420)