Unambiguous automata
From MaRDI portal
Publication:942992
DOI10.1007/s11786-007-0027-1zbMath1158.68019OpenAlexW4230862117WikidataQ62045956 ScholiaQ62045956MaRDI QIDQ942992
Marie-Pierre Béal, Jarkko Kari, Dominique Perrin, Eugen Czeizler
Publication date: 8 September 2008
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-007-0027-1
Related Items (6)
On the length of uncompletable words in unambiguous automata ⋮ Codes and noncommutative stochastic matrices ⋮ The Synchronization Problem for Strongly Transitive Automata ⋮ Modifying the Upper Bound on the Length of Minimal Synchronizing Word ⋮ Strongly transitive automata and the Černý conjecture ⋮ New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems
This page was built for publication: Unambiguous automata
