Pages that link to "Item:Q5609381"
From MaRDI portal
The following pages link to Definability in the monadic second-order theory of successor (Q5609381):
Displayed 23 items.
- Doomsday equilibria for omega-regular games (Q528193) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Finite-state \(\omega\)-languages (Q794443) (← links)
- Infinite-word languages and continuous mappings (Q1082087) (← links)
- The Borel hierarchy is infinite in the class of regular sets of trees (Q1210306) (← links)
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages (Q1240574) (← links)
- The theory of successor with an extra predicate (Q1243711) (← links)
- Computation as social agency: what, how and who (Q1641025) (← links)
- Model-checking iterated games (Q1674862) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- The monadic theory of morphic infinite words and generalizations (Q1854542) (← links)
- From automatic structures to automatic groups. (Q2016098) (← links)
- Distributed synthesis is simply undecidable (Q2445907) (← links)
- Decidability and undecidability of theories with a predicate for the primes (Q3138021) (← links)
- On Monadic Theories of Monadic Predicates (Q3586024) (← links)
- Tighter Bounds for the Determinisation of Büchi Automata (Q3617728) (← links)
- On the bounded monadic theory of well-ordered structures (Q3877655) (← links)
- The recursive sets in certain monadic second order fragments of arithmetic (Q4088807) (← links)
- (Q4585066) (← links)
- On the classification of computable languages (Q5048927) (← links)
- Decision problems forω-automata (Q5573396) (← links)
- A list of arithmetical structures complete with respect to the first-order definability (Q5941257) (← links)
- Enumerating grammar-based extractions (Q6069180) (← links)