A note on partially ordered tree automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 4035179 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1903379 (Why is no real title available?)
- A note on the commutative closure of star-free languages
- Classifying regular events in symbolic logic
- Efficiency of automata in semi-commutation verification techniques
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Logic, semigroups and automata on words
- On Shuffle Ideals
- Ordering by Divisibility in Abstract Algebras
- Permutation rewriting and algorithmic verification
- Polynomial closure and unambiguous product
- Reachability analysis over term rewriting systems
- Term Rewriting and Applications
Cited in
(5)- Partially ordered two-way Büchi automata
- scientific article; zbMATH DE number 4131692 (Why is no real title available?)
- scientific article; zbMATH DE number 7350780 (Why is no real title available?)
- scientific article; zbMATH DE number 2087227 (Why is no real title available?)
- scientific article; zbMATH DE number 475614 (Why is no real title available?)
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)
