scientific article; zbMATH DE number 1953272
From MaRDI portal
Publication:4414724
zbMATH Open1026.68085MaRDI QIDQ4414724FDOQ4414724
Authors: Arto Salomaa 
Publication date: 27 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2566/25660037.htm
Title of this publication is not available (Why is that?)
Recommendations
- Generation of constants and synchronization of finite automata
- Composition sequences and synchronizing automata
- The Synchronization Problem for Locally Strongly Transitive Automata
- Composition sequences for functions over a finite domain.
- Compositions over a finite domain: From completeness to synchronizable automata
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (23)
- On synchronizing unambiguous automata
- Introducing synchrony in fuzzy automata
- Semisimple synchronizing automata and the Wedderburn-Artin theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compositions over a finite domain: From completeness to synchronizable automata
- Synchronization of finite automata
- Generation of constants and synchronization of finite automata
- Composition sequences and synchronizing automata
- Synchronizing finite automata with short reset words
- Subset synchronization and careful synchronization of binary finite automata
- SYNCHRONIZATION OF TWO INTERACTING FINITE AUTOMATA
- Synchronizing Automata with Extremal Properties
- Synchronizing generalized monotonic automata
- Composition sequences for functions over a finite domain.
- Deterministic synchronization of automata with bounded delay
- Synchronizing finite automata on Eulerian digraphs.
- On the Synchronisation Problem over Cellular Automata
- Title not available (Why is that?)
- On synchronizing automata and uniform distribution
- Synchronizing words for real-time deterministic pushdown automata (extended abstract)
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- A QUASI-OPTIMAL TIME FOR SYNCHRONIZING TWO INTERACTING FINITE AUTOMATA
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414724)
