Traces of term-automatic graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1512622 (Why is no real title available?)
- scientific article; zbMATH DE number 1834676 (Why is no real title available?)
- scientific article; zbMATH DE number 806750 (Why is no real title available?)
- scientific article; zbMATH DE number 3257407 (Why is no real title available?)
- Alternation
- Classes of languages and linear-bounded automata
- Context-Sensitive Languages, Rational Graphs and Determinism
- Context-sensitive string languages and recognizable picture languages
- Families of automata characterizing context-sensitive languages
- One-sided and two-sided context in formal grammars
Cited in
(7)- scientific article; zbMATH DE number 1948515 (Why is no real title available?)
- 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)