Algebraic systems and pushdown automata
From MaRDI portal
Publication:3098041
DOI10.1007/978-3-642-24897-9_11zbMATH Open1251.68135OpenAlexW2134890666MaRDI QIDQ3098041FDOQ3098041
Authors: W. Kuich
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
Recommendations
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70)
Cites Work
- Title not available (Why is that?)
- Chain-complete posets and directed sets with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- A unifying Kleene theorem for weighted finite automata
- Title not available (Why is that?)
- Context-free series on trees
- Title not available (Why is that?)
- Algebraic semantics
- Title not available (Why is that?)
- Pushdown tree automata, algebraic tree systems, and algebraic tree series
- Title not available (Why is that?)
Cited In (7)
- Pushdown tree automata, algebraic tree systems, and algebraic tree series
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A unifying approach to algebraic systems over semirings
- A Note on Pushdown Automata Systems
- Algebraic systems and pushdown automata
This page was built for publication: Algebraic systems and pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098041)