Deterministic synchronization of automata with bounded delay
From MaRDI portal
Publication:1127313
Recommendations
- On the bound of the synchronization delay of a local automaton
- A tight linear bound on the synchronization delay of bijective automata
- Synchronizing automata of bounded rank
- Synchronization of finite automata
- Synchronization and stability of finite automata
- Careful synchronization of partial deterministic finite automata
- Synchronization of Regular Automata
- Synchronization of Pushdown Automata
- Synchronizing Automata with Extremal Properties
- scientific article; zbMATH DE number 1953272
Cites work
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3311783 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- Fibonacci representations and finite automata
- On Relations Defined by Generalized Finite Automata
- On the linearity of on-line computable functions
- On-Line Algorithms for Division and Multiplication
- Representations of numbers and finite automata
- Some characterizations of functions computable in on-line arithmetic
- Sur une variante des fonctions séquentielles
- Synchronized rational relations of finite and infinite words
Cited in
(9)- On the computation of covert channel capacity
- On the sequentiality of the successor function
- Minimization algorithms for sequential transducers
- On-line digit set conversion in real base.
- Asynchronous sliding block maps
- Synchronizing delay for binary uniform morphisms
- On-line finite automata for addition in some numeration systems
- A QUASI-OPTIMAL TIME FOR SYNCHRONIZING TWO INTERACTING FINITE AUTOMATA
- A tight linear bound on the synchronization delay of bijective automata
This page was built for publication: Deterministic synchronization of automata with bounded delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127313)
