Algebraic Systems and Pushdown Automata
From MaRDI portal
Publication:3098041
DOI10.1007/978-3-642-24897-9_11zbMath1251.68135OpenAlexW2134890666MaRDI QIDQ3098041
Publication date: 11 November 2011
Published in: Algebraic Foundations in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24897-9_11
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)
Cites Work
- Algebraic semantics
- Chain-complete posets and directed sets with applications
- Pushdown tree automata, algebraic tree systems, and algebraic tree series
- Context-free series on trees
- A Unifying Kleene Theorem for Weighted Finite Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algebraic Systems and Pushdown Automata