An Algorithm Enumerating All Infinite Repetitions in a D0L System

Autor:	Klouda, Karel, Starosta, Štěpán
Rok vydání:	2013
Předmět:	Mathematics - Combinatorics Computer Science - Formal Languages and Automata Theory 68R15 G.2.1
Zdroj:	Journal of Discrete Algorithms, 33 (2015), 130-138
Druh dokumentu:	Working Paper
DOI:	10.1016/j.jda.2015.03.006
Popis:	We describe a simple algorithm which, for a given D0L system, returns all factors $v$ such that $v^k$ is in the language of the system for all $k$. This algorithm can be used to decide whether a D0L system is repetitive. Comment: 10 pages, one figure
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1307.6408 Zobrazit plný text záznamu View this record from Arxiv