Careful Synchronization of Partial Automata with Restricted Alphabets

DOI10.1007/978-3-642-38536-0_7zbMath1381.68129OpenAlexW120468736MaRDI QIDQ4928474

Pavel Martyugin

Publication date: 14 June 2013

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_7

zbMATH Keywords

Černý conjecturesynchronizing wordspartial automatacareful synchronization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Some results concerning careful synchronization of partial automata and subset synchronization of DFA's ⋮ Careful synchronization of partial deterministic finite automata ⋮ On the smallest synchronizing terms of finite tree automata ⋮ Lower Bounds for Synchronizing Word Lengths in Partial Automata ⋮ The relation between preset distinguishing sequences and synchronizing sequences

This page was built for publication: Careful Synchronization of Partial Automata with Restricted Alphabets