Synchronizing Sequences for Probabilistic Automata

DOI10.1002/sapm1970491101zbMath0193.33401OpenAlexW2606721008MaRDI QIDQ5588688

D. J. Kfoury

Publication date: 1970

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sapm1970491101

zbMATH Keywords

languages, automata, networks

Related Items (6)

On synchronizing unambiguous automata ⋮ Synchronization of Parikh automata ⋮ Probabilistic automata ⋮ The complexity of synchronizing Markov decision processes ⋮ Rank of a finite automaton ⋮ Sync-maximal permutation groups equal primitive permutation groups

Cites Work

• Unsolvability in 3 × 3 Matrices
• Unnamed Item

This page was built for publication: Synchronizing Sequences for Probabilistic Automata