Automata, Semigroups and Recognizability of Words on Ordinals

DOI10.1142/S0218196798000028zbMath0923.20048MaRDI QIDQ4354234

Nicolas Bedon

Publication date: 15 September 1997

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

regular languages; Choueka automata; syntactic congruences; \(\omega^n\)-semigroups; generalizations of \(\omega\)-semigroups; Kleene closure operators

Mathematics Subject Classification ID

68Q70: Algebraic theory of languages and automata

20M35: Semigroups in automata theory, linguistics, etc.

Related Items

The Wadge-Wagner hierarchy of ω-rational sets, COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS, Schützenberger and Eilenberg theorems for words on linear orderings, Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\), Factorization forests for infinite words and applications to countable scattered linear orderings, Logic over words on denumerable ordinals, Star-free sets of words on ordinals, Complementation of rational sets on scattered linear orderings of finite rank

Cites Work

• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Finite automata and ordinals
• On finite monoids having only trivial subgroups
• Testing and generating infinite sequences by a finite automaton