Efficient simplicity testing of automata
From MaRDI portal
Recommendations
Cites work
- Characterization of idempotent transformation monoids
- Complexity of some problems from the theory of automata
- scientific article; zbMATH DE number 3819106 (Why is no real title available?)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 3179521 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3770955 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 3501790 (Why is no real title available?)
- scientific article; zbMATH DE number 3552814 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3390671 (Why is no real title available?)
- On the computational power of pushdown automata
- On the varieties of completely regular semigroups
- The amalgamation of automata
Cited in
(3)
This page was built for publication: Efficient simplicity testing of automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193902)