Exact synchronization in partial deterministic automata

An automaton is a synchronizing if it has an input word that transfers it from any state to a particular state. There are two versions of synchronization in partial deterministic automata: careful synchronization and exact synchronization. In this paper we focus on the exact version; we survey the c...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1352; no. 1; pp. 12047 - 12054
Main Author Shabana, H
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.10.2019
Subjects
Algorithms
Automata theory
Physics
Synchronism
Online AccessGet full text

Cover

More Information
Summary:An automaton is a synchronizing if it has an input word that transfers it from any state to a particular state. There are two versions of synchronization in partial deterministic automata: careful synchronization and exact synchronization. In this paper we focus on the exact version; we survey the complexity of testing exact synchronization and describe a SAT solver based algorithm for calculating the length of the shortest exact synchronizing word.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1352/1/012047