Publication:5509690
From MaRDI portal
zbMath0137.01101MaRDI QIDQ5509690
Publication date: 1964
Full work available at URL: https://eudml.org/doc/29801
68Q45: Formal languages and automata
Related Items
Les automates circulaires biaisés vérifient la conjecture de Černý, Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata, Estimation of the length of reset words for automata with simple idempotents, A graph theoretic approach to automata minimality, Complexity of problems concerning reset words for cyclic and Eulerian automata, Recent results on syntactic groups of prefix codes., Synchronizing automata with finitely many minimal synchronizing words, Synchronizing monotonic automata, The Černý conjecture for one-cluster automata with prime length cycle, Shortest synchronizing strings for Huffman codes, Synchronizing automata preserving a chain of partial orders, Synchronizing automata with a letter of deficiency 2, Algorithms for media, Synchronization, A series of slowly synchronizing automata with a zero state over a small alphabet, A finite set of functions with an EXPTIME-complete composition problem, Improved upper bounds on synchronizing nondeterministic automata, On synchronizing unambiguous automata, Image reducing words and subgroups of free groups., Synchronizing generalized monotonic automata, Černý's conjecture and group representation theory, Synchronizing groups and automata, Synchronizing Automata on Quasi-Eulerian Digraph, Synchronizing Automata of Bounded Rank, Synchronization of Automata with One Undefined or Ambiguous Transition, Synchronizing Automata Preserving a Chain of Partial Orders, The Synchronization Problem for Strongly Transitive Automata, Synchronizing Automata and the Černý Conjecture, 2-Synchronizing Words, Shortest Synchronizing Strings for Huffman Codes, Representation theory of finite semigroups, semigroup radicals and formal language theory, Matrix Mortality and the Černý-Pin Conjecture
Cites Work
