scientific article; zbMATH DE number 846959
From MaRDI portal
Publication:4864787
zbMATH Open0844.68085MaRDI QIDQ4864787FDOQ4864787
Authors: I. K. Rystsov 
Publication date: 5 September 1996
Title of this publication is not available (Why is that?)
Recommendations
Cited In (22)
- Primitive groups synchronize non-uniform maps of extreme ranks
- On a conjecture by Carpi and D'Alessandro
- On the height of a finite automaton
- Title not available (Why is that?)
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
- Estimation of the length of reset words for automata with simple idempotents
- Imprimitive groups synchronizing a transformation of non-uniform kernel
- On a conjecture by Carpi and D'Alessandro
- Černý's conjecture and group representation theory
- Lower Bounds for the Length of Reset Words in Eulerian Automata
- Simplicity of augmentation submodules for transformation monoids
- Automaton mappings of words which multiply errors by a factor no greater than K in the Hamming and Levenshtein metrics
- An algorithm for road coloring
- Primitive groups, graph endomorphisms and synchronization
- Synchronizing Automata with Extremal Properties
- Černý's conjecture and the road colouring problem
- The Černý conjecture for one-cluster automata with prime length cycle
- Almost optimal bound of recurrent word length for regular automata
- Title not available (Why is that?)
- Synchronizing quasi-Eulerian and quasi-one-cluster automata
- Orbits of primitive \(k\)-homogeneous groups on \((n-k)\)-partitions with applications to semigroups
- Matrix Mortality and the Černý-Pin Conjecture
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864787)
