Finitely generated ideal languages and synchronizing automata
Formal Languages and Automata Theory
2013-05-03 v1
Abstract
We study representations of ideal languages by means of strongly connected synchronizing automata. For every finitely generated ideal language L we construct such an automaton with at most 2^n states, where n is the maximal length of words in L. Our constructions are based on the De Bruijn graph.
Keywords
Cite
@article{arxiv.1305.0336,
title = {Finitely generated ideal languages and synchronizing automata},
author = {Vladimir V. Gusev and Marina I. Maslennikova and Elena V. Pribavkina},
journal= {arXiv preprint arXiv:1305.0336},
year = {2013}
}
Comments
Submitted to WORDS 2013