Synchronization
From MaRDI portal
Publication:948067
DOI10.1016/j.ic.2008.03.005zbMath1160.68021OpenAlexW4211050463WikidataQ56767142 ScholiaQ56767142MaRDI QIDQ948067
Publication date: 8 October 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.005
Related Items (14)
Some results concerning careful synchronization of partial automata and subset synchronization of DFA's ⋮ Completely distinguishable automata and the set of synchronizing words ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ Synchronizing automata with coinciding cycles ⋮ Primitive groups, graph endomorphisms and synchronization ⋮ Binary and circular automata having maximal state complexity for the set of synchronizing words ⋮ Preimage problems for deterministic finite automata ⋮ A quadratic algorithm for road coloring ⋮ Complexity of Preimage Problems for Deterministic Finite Automata ⋮ Algebraic synchronization criterion and computing reset words ⋮ Genetic Algorithm for Synchronization ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ Computing the shortest reset words of synchronizing automata ⋮ Synchronizing sequences on a class of unbounded systems using synchronized Petri nets
Cites Work
- Decoders with initial state invariance for multivalued encodings
- Solid codes and disjunctive domains
- An algebra of discrete channels that involve combinations of three basic error types
- Sticky-free and overhang-free DNA languages
- The Mathematical Foundation of Informatics
- Notable trends concerning the synchronization of graphs and automata
- Reset Sequences for Monotonic Automata
- Synchronizing Automata Preserving a Chain of Partial Orders
- SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
- Error correction for channels with substitutions, insertions, and deletions
- Structural analysis of error-correcting codes for discrete channels that involve combinations of three basic error types
- Near-optimal, single-synchronization-error-correcting code
- On the capabilities of codes to correct synchronization errors
- Finite maximal solid codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Synchronization
