Star-free sets of words on ordinals
type: Item
instance of: scholarly article
title: Star-free sets of words on ordinals
zbMATH Open document ID: 1007.68095
author: Nicolas Bedon
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 1853170
MaRDI profile type: Publication
full work available at URL: inco.2000.3009
OpenAlex ID: W2005848337
cites work: Q3838998
cites work: Logic over words on denumerable ordinals
cites work: Finite automata and ordinals
cites work: Automata, Semigroups and Recognizability of Words on Ordinals
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Q5525343
cites work: Q5608007
cites work: Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
cites work: An application of games to the completeness problem for formalized theories
cites work: Application of model theoretic games to discrete linear orders and finite automata
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Q5641083
cites work: Q3752578
cites work: Q3728249
cites work: Q3698327
cites work: Q3999156
cites work: Logic, semigroups and automata on words
cites work: First-order logic and star-free sets
cites work: Q3949052
cites work: On finite monoids having only trivial subgroups
cites work: Q5340125
cites work: Q4302435
cites work: Star-free regular sets of ω-sequences
cites work: Q4036596
DOI: 10.1006/INCO.2000.3009
description: scientific article; zbMATH DE number 1853170