Automata accepting primitive words

DOI10.1007/BF02573122zbMATH Open0646.20055OpenAlexW2049135619MaRDI QIDQ1103732FDOQ1103732

Authors: H. J. Shyr, Masami Ito, Masashi Katsura, Shyr-Shen Yu 

Publication date: 1988

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/134913

Recommendations

• scientific article; zbMATH DE number 558591
• Abelian Primitive Words
• scientific article; zbMATH DE number 763521
• On the language of primitive words
• Abelian primitive words

zbMATH Keywords

finite automataprimitive wordsfinite alphabet

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

• Some operations preserving primitivity of words
• Finite Completion of comma-free codes Part 2
• On the language of primitive words
• Shortest repetition-free words accepted by automata
• Primitive and irreducible automata
• Completing comma-free codes
• Detecting palindromes, patterns and borders in regular languages
• From decidability to undecidability by considering regular sets of instances
• Automaticity of primitive words and irreducible polynomials
• Finite Automata, Palindromes, Powers, and Patterns
• On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems
• Primitive sets of words

This page was built for publication: Automata accepting primitive words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103732)