scientific article; zbMATH DE number 7378338
From MaRDI portal
Publication:5005121
DOI10.4230/LIPIcs.MFCS.2018.21MaRDI QIDQ5005121
Marek Szykuła, Andrew Ryzhikov
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1806.06299
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Synchronization problems in automata without non-trivial cycles ⋮ On finite monoids over nonnegative integer matrices and short killing words ⋮ On Nonnegative Integer Matrices and Short Killing Words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Shortest synchronizing strings for Huffman codes
- On maximal codes with bounded synchronization delay
- Approximating the minimum length of synchronizing words is hard
- Algebraic synchronization criterion and computing reset words
- On Two Algorithmic Problems about Synchronizing Automata
- Strong Inapproximability of the Shortest Reset Word
- Approximating Minimum Reset Sequences
- A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
- Reset Sequences for Monotonic Automata
- Synchronizing Automata and the Černý Conjecture
- Almost all complete binary prefix codes have a self-synchronizing string
- Slowly Synchronizing Automata and Digraphs
- On two Combinatorial Problems Arising from Automata Theory
- On the construction of statistically synchronizable codes
- Subset Synchronization in Monotonic Automata
- Applications of approximation algorithms to cooperative games
- On synchronizing prefix codes
- On the synchronizing properties of certain prefix codes
- Synchronization problems in automata without non-trivial cycles
This page was built for publication:
