A strongly primitive word of arbitrary length and its application †

DOI10.1080/00207167708803136zbMath0405.68066OpenAlexW2012196489MaRDI QIDQ4191624

H. J. Shyr

Publication date: 1977

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167708803136

zbMATH Keywords

Free MonoidLanguages Accepted By AutomataFinite Time-Variant Automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

An efficient algorithm for online square detection

Cites Work

• Classification of noncounting events
• On finite automata with a time-variant structure

This page was built for publication: A strongly primitive word of arbitrary length and its application †