A note on partially ordered tree automata
From MaRDI portal
Publication:975463
DOI10.1016/j.ipl.2008.05.012zbMath1191.68387MaRDI QIDQ975463
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.012
68Q45: Formal languages and automata
Uses Software
Cites Work
- Reachability analysis over term rewriting systems
- A note on the commutative closure of star-free languages
- Permutation rewriting and algorithmic verification
- Classifying regular events in symbolic logic
- Polynomial closure and unambiguous product
- Logic, semigroups and automata on words
- Efficiency of automata in semi-commutation verification techniques
- On Shuffle Ideals
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Term Rewriting and Applications
- Ordering by Divisibility in Abstract Algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item