Unambiguous automata
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4094825
- Unambiguity in automata theory
- scientific article; zbMATH DE number 1512707
- Unambiguous constrained automata
- Unambiguous constrained automata
- Structurally Unambiguous Finite Automata
- Unambiguous finite automata over a unary alphabet
- Unambiguous finite automata over a unary alphabet
- Unambiguous automata denoting finitely sequential functions
Cited in
(17)- Strongly transitive automata and the Černý conjecture
- On the bound of the synchronization delay of a local automaton
- Unambiguous Büchi automata.
- Codes and noncommutative stochastic matrices
- Mortality and synchronization of unambiguous finite automata
- New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems
- Operations on Unambiguous Finite Automata
- Unary Self-verifying Symmetric Difference Automata
- Modifying the upper bound on the length of minimal synchronizing word
- The Synchronization Problem for Strongly Transitive Automata
- Operations on Unambiguous Finite Automata
- On the length of uncompletable words in unambiguous automata
- scientific article; zbMATH DE number 6741931 (Why is no real title available?)
- Synchronizing strongly connected partial DFAs
- Monoids of upper triangular matrices over the Boolean semiring
- Efficiently computing the minimum rank of a matrix in a monoid of zero-one matrices
- Synchronization of strongly connected partial DFAs and prefix codes
This page was built for publication: Unambiguous automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q942992)
