scientific article
From MaRDI portal
zbMath0577.68076MaRDI QIDQ3698327
Publication date: 1984
infinite treesunambiguityrecognizable set of infinite wordstwo-sided infinite wordsstar free sets of infinite words
Related Items
Towards a language theory for infinite N-free pomsets., First-order logic and star-free sets, Rabin tree automata and finite monoids, An introduction to the regular theory of fairness, Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words), Pure future local temporal logics are expressively complete for Mazurkiewicz traces, Weighted tree automata with constraints, On projective and separable properties, Characterizing classes of regular languages using prefix codes of bounded synchronization delay, Schützenberger and Eilenberg theorems for words on linear orderings, 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, Logical definability on infinite traces, Quantum \(\omega\)-automata over infinite words and their relationships, Varieties of finite monoids and Büchi-McNaughton theorem, The poset of infinitary traces, The stuttering principle revisited, Weighted tree automata with constraints, Logic and rational languages of words indexed by linear orderings, Unnamed Item, Quantifier Alternation for Infinite Words, Logic, semigroups and automata on words, Wreath product and infinite words, Star-free sets of words on ordinals, On the expressive power of temporal logic for infinite words, Logical definability on infinite traces, Logic over words on denumerable ordinals
