Automata accepting primitive words
From MaRDI portal
Publication:1103732
DOI10.1007/BF02573122zbMath0646.20055OpenAlexW2049135619MaRDI QIDQ1103732
H. J. Shyr, Masashi Katsura, Shyr-Shen Yu, Masami Ito
Publication date: 1988
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/134913
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (8)
On the language of primitive words ⋮ Finite Completion of comma-free codes Part 2 ⋮ Completing comma-free codes ⋮ Finite Automata, Palindromes, Powers, and Patterns ⋮ On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems ⋮ Some operations preserving primitivity of words ⋮ From decidability to undecidability by considering regular sets of instances ⋮ Detecting palindromes, patterns and borders in regular languages
Cites Work
This page was built for publication: Automata accepting primitive words
