Zobrazeno 1 - 10
of 201
pro vyhledávání: '"Berstel, Jean"'
In this paper, we prove decidability properties and new results on the position of the family of languages generated by (circular) splicing systems within the Chomsky hierarchy. The two main results of the paper are the following. First, we show that
Externí odkaz:
http://arxiv.org/abs/1102.0947
Autor:
Berstel, Jean, De Felice, Clelia, Perrin, Dominique, Reutenauer, Christophe, Rindone, Giuseppina
Publikováno v:
Journal of Algebra, 369, 146-202, 2012
We prove new results concerning the relation between bifix codes, episturmian words and subgroups offree groups. We study bifix codes in factorial sets of words. We generalize most properties of ordinary maximal bifix codes to bifix codes maximal in
Externí odkaz:
http://arxiv.org/abs/1011.5369
This chapter is concerned with the design and analysis of algorithms for minimizing finite automata. Getting a minimal automaton is a fundamental issue in the use and implementation of finite automata tools in frameworks like text processing, image a
Externí odkaz:
http://arxiv.org/abs/1010.5318
This chapter presents some of the links between automata theory and symbolic dynamics. The emphasis is on two particular points. The first one is the interplay between some particular classes of automata, such as local automata and results on embeddi
Externí odkaz:
http://arxiv.org/abs/1006.1265
We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only finitely many palindromic factors.
Comment: 3 pages
Comment: 3 pages
Externí odkaz:
http://arxiv.org/abs/0903.2382