Deterministic synchronization of automata with bounded delay
From MaRDI portal
Publication:1127313
DOI10.1016/S0304-3975(96)00305-2zbMath1015.68128OpenAlexW3021586194MaRDI QIDQ1127313
Jacques Sakarovitch, Christiane Frougny
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00305-2
Related Items (6)
On-line finite automata for addition in some numeration systems ⋮ On the sequentiality of the successor function ⋮ On the computation of covert channel capacity ⋮ Minimization algorithms for sequential transducers ⋮ On-line digit set conversion in real base. ⋮ Asynchronous sliding block maps
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synchronized rational relations of finite and infinite words
- Sur une variante des fonctions séquentielles
- On the linearity of on-line computable functions
- Fibonacci representations and finite automata
- Representations of numbers and finite automata
- On-Line Algorithms for Division and Multiplication
- Some characterizations of functions computable in on-line arithmetic
- On Relations Defined by Generalized Finite Automata
This page was built for publication: Deterministic synchronization of automata with bounded delay