The synchronized graphs trace the context-sensitive languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1512622 (Why is no real title available?)
- scientific article; zbMATH DE number 1738661 (Why is no real title available?)
- scientific article; zbMATH DE number 2102748 (Why is no real title available?)
- Classes of languages and linear-bounded automata
- Decidability of Second-Order Theories and Automata on Infinite Trees
- On Relations Defined by Generalized Finite Automata
- One-sided and two-sided context in formal grammars
- Synchronized rational relations of finite and infinite words
- The theory of ends, pushdown automata, and second-order logic
Cited in
(10)- Traces of term-automatic graphs
- Context-Sensitive Languages, Rational Graphs and Determinism
- Linearly bounded infinite graphs
- Families of automata characterizing context-sensitive languages
- scientific article; zbMATH DE number 7438568 (Why is no real title available?)
- Traces of Term-Automatic Graphs
- An Infinite Automaton Characterization of Double Exponential Time
- Rewriting higher-order stack trees
- Rewriting higher-order stack trees
- scientific article; zbMATH DE number 2087223 (Why is no real title available?)
This page was built for publication: The synchronized graphs trace the context-sensitive languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842874)