Rank of a finite automaton
From MaRDI portal
Publication:1816131
DOI10.1007/BF01125412zbMath0875.68658MaRDI QIDQ1816131
Publication date: 6 January 1997
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
68Q70: Algebraic theory of languages and automata
Related Items
Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines, Estimation of the length of reset words for automata with simple idempotents, Synchronization problems in automata without non-trivial cycles, A note on the rank of semigroups., Synchronizing finite automata with short reset words, On automata recognizing birecurrent sets, Almost optimal bound of recurrent word length for regular automata, Reaching the minimum ideal in a finite semigroup, Matrix Mortality and the Černý-Pin Conjecture
Cites Work