scientific article
From MaRDI portal
Publication:2842874
zbMath1270.68141MaRDI QIDQ2842874
Publication date: 16 August 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066104805334
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Related Items (6)
Linearly bounded infinite graphs ⋮ Rewriting Higher-Order Stack Trees ⋮ Rewriting higher-order stack trees ⋮ Unnamed Item ⋮ An Infinite Automaton Characterization of Double Exponential Time ⋮ Families of automata characterizing context-sensitive languages
Cites Work
- Synchronized rational relations of finite and infinite words
- The theory of ends, pushdown automata, and second-order logic
- One-sided and two-sided context in formal grammars
- On Relations Defined by Generalized Finite Automata
- Classes of languages and linear-bounded automata
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
