Deterministic incomplete automata: Simulation, universality and complementarity
From MaRDI portal
Recommendations
- Deterministic automata. Simulation, universality and minimality
- Exact complexity of problems of incompletely specified automata
- scientific article; zbMATH DE number 4179361
- scientific article; zbMATH DE number 4201640
- On completeness of nondeterministic automata
- A formal theory of simulations between infinite automata
- Determinization and Complementation of Streett Automata
- scientific article; zbMATH DE number 1927559
- Finite nondeterministic automata: simulation and minimality
- Enumeration and random generation of possibly incomplete deterministic automata
Cited in
(7)- Deterministic automata. Simulation, universality and minimality
- Finite nondeterministic automata: simulation and minimality
- Exact complexity of problems of incompletely specified automata
- scientific article; zbMATH DE number 1543070 (Why is no real title available?)
- scientific article; zbMATH DE number 1775501 (Why is no real title available?)
- Computational complementarity and sofic shifts
- Computational complementarity and shift spaces
This page was built for publication: Deterministic incomplete automata: Simulation, universality and complementarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3838838)
