Pages that link to "Item:Q1211504"
From MaRDI portal
The following pages link to Theories of automata on \(\omega\)-tapes: a simplified approach (Q1211504):
Displaying 50 items.
- Determinization of ordinal automata (Q383176) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- Interval logics and their decision procedures. I: An interval logic (Q671639) (← links)
- Finite-state \(\omega\)-languages (Q794443) (← links)
- Alternating finite automata on \(\omega\)-words (Q796990) (← links)
- Inferring answers to queries (Q927868) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- A classification of \(\omega\)-regular languages (Q1058863) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions (Q1079373) (← links)
- Infinite-word languages and continuous mappings (Q1082087) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- On a subclass of \(\infty\)-regular languages (Q1104761) (← links)
- Complementing deterministic Büchi automata in polynomial time (Q1116702) (← links)
- On the complexity of \(\omega\)-type Turing acceptors (Q1138912) (← links)
- On direct products of automaton decidable theories (Q1168306) (← links)
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems (Q1179180) (← links)
- \(\omega\)-languages accepted by finite automata whose structures are cascade products o resets (Q1183179) (← links)
- On condition/event systems with discrete state realizations (Q1185286) (← links)
- A decidability result for deterministic \(\omega\)-context-free languages (Q1239008) (← links)
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages (Q1240574) (← links)
- \(\omega\)-computations on Turing machines (Q1242685) (← links)
- \(\omega\)-computations on deterministic pushdown machines (Q1247962) (← links)
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes (Q1249573) (← links)
- A theory of timed automata (Q1322162) (← links)
- Finite automata and ordinals (Q1351785) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- A compositional approach to CTL\(^*\) verification (Q1770366) (← links)
- On the complementation of Büchi automata (Q1822512) (← links)
- Pictures of functions and their acceptability by automata (Q1836301) (← links)
- Automata techniques for query inference machines (Q1849855) (← links)
- Verification by augmented finitary abstraction (Q1854391) (← links)
- Valuations, regular expressions, and fractal geometry (Q1908904) (← links)
- Infinite behaviour of Petri nets (Q2265817) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
- From complementation to certification (Q2575735) (← links)
- Classes of Timed Automata and the Undecidability of Universality (Q2842589) (← links)
- Decidability and undecidability of theories with a predicate for the primes (Q3138021) (← links)
- Asymptotic Subword Complexity (Q3166955) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- Linear-Time Model Checking: Automata Theory in Practice (Q3503888) (← links)
- Büchi Complementation and Size-Change Termination (Q3617751) (← links)
- (Q4147597) (← links)
- ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES (Q4652792) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- Rabin vs. Streett Automata (Q5136307) (← links)
- Knowledge-based programs (Q5137342) (← links)
- Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
