scientific article; zbMATH DE number 3924161
[For the entire collection see Zbl 0544.00022.] The paper is divided into four sections. In the first one, I recall some of the basic definitions and results. Part of them can be found in Chapter XIV of \textit{S. Eilenberg}'s book Automata, languages and machines, Vol. A (1974; Zbl 0317.94045), whose notation I follow. In the second section, I discuss the matter of star free sets of infinite words. A new result is proved there, according to which one can decide wether a given recognizable set of infinite words is star free. In the third section, an extension of the previous notions to two-sided infinite words is presented. This extension to a higher ordinal has two main features: (1) most results holding in the one sided case still hold in this case, though it is by no means a trivial extension; (2) extensions to other ordinals such as the theory of infinite trees present quite different features. In the last section I present some results on unambiguity.
- First-order logic and star-free sets
- An introduction to the regular theory of fairness
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)
- Varieties of finite monoids and Büchi-McNaughton theorem
- Rabin tree automata and finite monoids
- On projective and separable properties
- Wreath product and infinite words
- Logic over words on denumerable ordinals
- Quantum \(\omega\)-automata over infinite words and their relationships
- Logic, semigroups and automata on words
- Star-free sets of words on ordinals
- Towards a language theory for infinite N-free pomsets.
- Weighted tree automata with constraints
- The stuttering principle revisited
- Quantifier alternation for infinite words
- scientific article; zbMATH DE number 3976377 (Why is no real title available?)
- Schützenberger and Eilenberg theorems for words on linear orderings
- Characterizing classes of regular languages using prefix codes of bounded synchronization delay
- Logical definability on infinite traces
- Automata to recognize finite and infinite words with at least two factorizations on a given finite set
- On canonical models for rational functions over infinite words
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- Weighted tree automata with constraints
- On the translation of automata to linear temporal logic
- First-order separation over countable ordinals
- Solving the Weighted HOM-Problem With the Help of Unambiguity
- The weighted HOM-problem over fields
- Logical definability on infinite traces
- Automata-theoretic characterisations of branching-time temporal logics
- The poset of infinitary traces
- Weighted HOM-problem for nonnegative integers
- On the expressive power of temporal logic for infinite words
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces
- Logic and rational languages of words indexed by linear orderings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698327)