Experiments with Synchronizing Automata
From MaRDI portal
Publication:2830218
DOI10.1007/978-3-319-40946-7_15zbMath1475.68159arXiv1607.04025OpenAlexW3098021959MaRDI QIDQ2830218
Jakub Kowalski, Marek Szykuła, Andrzej P. Kisielewicz
Publication date: 9 November 2016
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.04025
Related Items (10)
Unnamed Item ⋮ Synchronizing sequences for road colored digraphs ⋮ Lower Bounds for Synchronizing Word Lengths in Partial Automata ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ Algebraic synchronization criterion and computing reset words ⋮ Slowly synchronizing automata with fixed alphabet size ⋮ Extremal synchronizing circular automata ⋮ An Extremal Series of Eulerian Synchronizing Automata ⋮ Černý's conjecture and the road colouring problem ⋮ Attainable Values of Reset Thresholds
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Primitive digraphs with large exponents and slowly synchronizing automata
- The Černý conjecture for one-cluster automata with prime length cycle
- An extremal problem for two families of sets
- Independent sets of words and the synchronization problem
- Algebraic synchronization criterion and computing reset words
- THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE
- A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
- Modifying the Upper Bound on the Length of Minimal Synchronizing Word
- Reset Sequences for Monotonic Automata
- Synchronizing Automata and the Černý Conjecture
- Slowly Synchronizing Automata and Digraphs
- Matrix Mortality and the Černý-Pin Conjecture
- On two Combinatorial Problems Arising from Automata Theory
- Generating Small Automata and the Černý Conjecture
- Developments in Language Theory
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
This page was built for publication: Experiments with Synchronizing Automata
