Automata, Semigroups and Recognizability of Words on Ordinals

DOI10.1142/S0218196798000028zbMath0923.20048OpenAlexW2028004422MaRDI QIDQ4354234

Nicolas Bedon

Publication date: 15 September 1997

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

Full work available at URL: https://doi.org/10.1142/s0218196798000028

zbMATH Keywords

regular languagesChoueka automatasyntactic congruences\(\omega^n\)-semigroupsgeneralizations of \(\omega\)-semigroupsKleene closure operators

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (9)

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

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

This page was built for publication: Automata, Semigroups and Recognizability of Words on Ordinals