Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: strongly connected automaton

Sortuj według:

Ogranicz wyniki do:

Trim Strongly Connected Synchronizing Automata and Ideal Languages

Maslennikova M., Rodaro E.

Fundamenta Informaticae

2018

Vol. 162, nr 2/3

183--203

We follow language theoretic approach to synchronizing automata and Černý’s conjecture initiated in a series of recent papers. We prove that for every ideal language there exists a strongly connected synchronizing automaton from some special class for which given language serves as the language of reset words. This class is formed by trim automata recognizing left quotients of principal left ideal languages. We show that the minimal automaton recognizing a left quotient of a principal left ideal can be viewed as a synchronizing automaton for which given finitely generated ideal serves as the language of reset words.

Principal Ideal Languages and Synchronizing Automata

Gusev V. V., Maslennikova M. I., Pribavkina E. V.

Fundamenta Informaticae

2014

Vol. 132, nr 1

95--108

We study ideal languages generated by a single word. We provide an algorithm to construct a strongly connected synchronizing automaton for which such a language serves as the language of synchronizing words. Also we present a compact formula to calculate the syntactic complexity of this language.