A note on partially ordered tree automata
From MaRDI portal
Publication:975463
DOI10.1016/J.IPL.2008.05.012zbMATH Open1191.68387OpenAlexW1987644139MaRDI QIDQ975463FDOQ975463
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classifying regular events in symbolic logic
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Polynomial closure and unambiguous product
- Logic, semigroups and automata on words
- Ordering by Divisibility in Abstract Algebras
- Efficiency of automata in semi-commutation verification techniques
- A note on the commutative closure of star-free languages
- Permutation rewriting and algorithmic verification
- Reachability analysis over term rewriting systems
- Term Rewriting and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Shuffle Ideals
Cited In (3)
Uses Software
Recommendations
This page was built for publication: A note on partially ordered tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975463)
