scientific article; zbMATH DE number 3924161

MaRDI QIDQ3698327zbMATH OpenFDO

Authors Dominique Perrin

Publication date 1984

zbMATH Keywords

infinite treesrecognizable set of infinite wordsstar free sets of infinite wordstwo-sided infinite wordsunambiguity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3947646
• Unambiguous Büchi automata.
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 988807
• Codeterministic automata on infinite words

Cited in

(34)

• 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
• scientific article; zbMATH DE number 1452991 (Why is no real title available?)
• 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)