A QUASI-OPTIMAL TIME FOR SYNCHRONIZING TWO INTERACTING FINITE AUTOMATA

DOI10.1142/S021819679600012XzbMath0852.68058OpenAlexW2153029683MaRDI QIDQ4892460

H. Vivien

Publication date: 15 September 1996

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021819679600012x

zbMATH Keywords

finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time \(D\lfloor \log_mD\rfloor\)

This page was built for publication: A QUASI-OPTIMAL TIME FOR SYNCHRONIZING TWO INTERACTING FINITE AUTOMATA