Rank of a finite automaton

DOI10.1007/BF01125412MaRDI QIDQ1816131zbMATH OpenFDO

Authors I. K. Rystsov

Publication date 6 January 1997

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

Full work available at URL https://doi.org/10.1007/BF01125412

zbMATH Keywords

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

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cites work

• scientific article; zbMATH DE number 3168668 (Why is no real title available?)
• scientific article; zbMATH DE number 3605922 (Why is no real title available?)
• Polynomial complete problems in automata theory
• Synchronizing Sequences for Probabilistic Automata
• Unsolvability in 3 × 3 Matrices

Cited in

(11)

• Synchronizing finite automata with short reset words
• On automata recognizing birecurrent sets
• Almost optimal bound of recurrent word length for regular automata
• Words of minimum rank in deterministic finite automata
• Reaching the minimum ideal in a finite semigroup
• Matrix Mortality and the Černý-Pin Conjecture
• Rank and statistical mapping of a strongly connected automaton
• Preset and adaptive homing experiments for nondeterministic finite state machines
• Estimation of the length of reset words for automata with simple idempotents
• A note on the rank of semigroups.
• Efficiently computing the minimum rank of a matrix in a monoid of zero-one matrices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1816131)