A combinatorial approach to the theory of ω-automata
From MaRDI portal
Publication:3934375
Cited in
(18)- scientific article; zbMATH DE number 7561335 (Why is no real title available?)
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)
- Languages versus \(\omega\)-languages in regular infinite games
- -languages accepted by finite automata whose structures are cascade products o resets
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Infinite-word languages and continuous mappings
- Towards a language theory for infinite N-free pomsets.
- Composition over the natural number ordering with an extra binary relation
- Decidability and undecidability of theories with a predicate for the primes
- Generalized automata on infinite trees and Muller-McNaughton's theorem
- Completing the temporal picture
- Logic, semigroups and automata on words
- Various hierarchies of \(\omega\)-regular sets
- Somewhat finite approaches to infinite sentences.
- Quantitative vs. weighted automata
- Determinization of ordinal automata
- On the translation of automata to linear temporal logic
- A list of arithmetical structures complete with respect to the first-order definability
This page was built for publication: A combinatorial approach to the theory of ω-automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3934375)