Rank of a finite automaton

DOI10.1007/BF01125412zbMath0875.68658MaRDI QIDQ1816131

I. K. Rystsov

Publication date: 6 January 1997

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

Cerny-Pin conjecturefinite abstract automatalength of terminal wordsrank of finite automaton

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (9)

Reaching the minimum ideal in a finite semigroup ⋮ On automata recognizing birecurrent sets ⋮ Almost optimal bound of recurrent word length for regular automata ⋮ A note on the rank of semigroups. ⋮ Estimation of the length of reset words for automata with simple idempotents ⋮ Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines ⋮ Synchronizing finite automata with short reset words ⋮ Synchronization problems in automata without non-trivial cycles ⋮ Matrix Mortality and the Černý-Pin Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Polynomial complete problems in automata theory
• Unsolvability in 3 × 3 Matrices
• Synchronizing Sequences for Probabilistic Automata

This page was built for publication: Rank of a finite automaton