On two Combinatorial Problems Arising from Automata Theory
From MaRDI portal
Cited in
(87)- Synchronizing finite automata with short reset words
- Strongly transitive automata and the Černý conjecture
- Inequalities for two set systems with prescribed intersections
- Synchronizing finite automata on Eulerian digraphs.
- Strongly connected synchronizing automata and the language of minimal reset words
- Some contributions to the theory of transformation monoids
- Synchronizing generalized monotonic automata
- Matchings and covers in hypergraphs
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
- Slowly synchronizing automata with fixed alphabet size
- Černý's conjecture and the road colouring problem
- Sync-maximal permutation groups equal primitive permutation groups
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's
- Synchronizing times for k-sets in automata
- Circular automata synchronize with high probability
- Černý's conjecture and group representation theory
- Using SAT solvers for synchronization issues in non-deterministic automata
- On the synchronizing probability function and the triple rendezvous time. New approaches to Černý's conjecture
- On the synchronizing probability function and the triple rendezvous time for synchronizing automata
- Synchronizing automata over nested words
- An extremal series of Eulerian synchronizing automata
- Experiments with Synchronizing Automata
- Synchronizing automata on quasi-Eulerian digraph
- Synchronizing automata of bounded rank
- Strong inapproximability of the shortest reset word
- Primitive groups, graph endomorphisms and synchronization
- COMPAS -- a computing package for synchronization
- Approximating minimum reset sequences
- Modifying the upper bound on the length of minimal synchronizing word
- The Černý conjecture and 1-contracting automata
- Primitive sets of nonnegative matrices and synchronizing automata
- Ideal regular languages and strongly connected synchronizing automata
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- Synchronizing Automata Preserving a Chain of Partial Orders
- Synchronizing Automata and the Černý Conjecture
- Shortest Synchronizing Strings for Huffman Codes
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- Genetic Algorithm for Synchronization
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
- Games with Opacity Condition
- Primitive digraphs with large exponents and slowly synchronizing automata
- Synchronizing random automata on a 4-letter alphabet
- Les automates circulaires biaisés vérifient la conjecture de Černý
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Finding short synchronizing words for prefix codes
- On randomized generation of slowly synchronizing automata
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- On the length of uncompletable words in unambiguous automata
- On the local invertibility of finite state automata without information loss
- A linear bound on the \(k\)-rendezvous time for primitive sets of NZ matrices
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Experimental study of the shortest reset word of random automata
- Lower bounds for synchronizing word lengths in partial automata
- On the interplay between Černý and Babai's conjectures
- Finding DFAs with maximal shortest synchronizing word length
- scientific article; zbMATH DE number 4185044 (Why is no real title available?)
- The Synchronizing Probability Function for Primitive Sets of Matrices
- Synchronizing almost-group automata
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
- Weakly saturated hypergraphs and a conjecture of Tuza
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
- Synchronizing automata with coinciding cycles
- Synchronizing words under \textsf{LTL} constraints
- Extremal Binary PFAs with Small Number of States
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Fast synchronization of inhomogenous random automata
- On the smallest synchronizing terms of finite tree automata
- On the smallest synchronizing terms of finite tree automata
- On Bollobás-type theorems of d-tuples
- Reset sink complexity of regular ideals
- Short synchronizing words for random automata
- An improved algorithm for finding the shortest synchronizing words
- Decidability of the isomorphism problem between multidimensional substitutive subshifts
- Careful synchronization of one-cluster automata
- The Černý conjecture for one-cluster automata with prime length cycle
- A cornering strategy for synchronizing a DFA
- Synchronizing strongly connected partial DFAs
- A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
- The hereditariness problem for the Černý conjecture
- The road coloring problem
- Geometrical solution of an intersection problem for two hypergraphs
- Extremal binary PFAs in a Černý family
- Shortest synchronizing strings for Huffman codes
- Synchronizing automata preserving a chain of partial orders
- A lower bound for the length of the shortest carefully synchronizing words
- Synchronizing automata with a letter of deficiency 2
- Improved upper bounds on synchronizing nondeterministic automata
This page was built for publication: On two Combinatorial Problems Arising from Automata Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674065)
