Pages that link to "Item:Q5613960"

The following pages link to Testing and generating infinite sequences by a finite automaton (Q5613960):

Displaying 50 items.

• Learning regular omega languages (Q329611) (← links)
• Logic programming approach to automata-based decision procedures (Q347398) (← links)
• Determinization of ordinal automata (Q383176) (← links)
• Path sets in one-sided symbolic dynamics (Q402586) (← links)
• Groups, graphs, languages, automata, games and second-order monadic logic (Q444388) (← links)
• Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
• On the classification of recursive languages (Q598240) (← links)
• Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
• Characterizations of rational \(\omega\)-languages by means of right congruences (Q673632) (← links)
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
• On Gabbay's temporal fixed point operator (Q673958) (← links)
• \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
• On relation between linear temporal logic and quantum finite automata (Q783667) (← links)
• Some remarks on non-algebraic adherences (Q786543) (← links)
• Finite-state \(\omega\)-languages (Q794443) (← links)
• Alternating finite automata on \(\omega\)-words (Q796990) (← links)
• Characterization of \(\omega\)-regular languages by first-order formulas (Q800737) (← links)
• Relations rationnelles infinitaires (Q801688) (← links)
• Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective (Q843994) (← links)
• Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364) (← links)
• Observations on determinization of Büchi automata (Q860867) (← links)
• Profile trees for Büchi word automata, with application to determinization (Q897653) (← links)
• Probabilistic verification of communication protocols (Q916356) (← links)
• The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction (Q917321) (← links)
• A tighter analysis of Piterman's Büchi determinization (Q989532) (← links)
• Mathematical logic and quantum finite state automata (Q1017412) (← links)
• A classification of \(\omega\)-regular languages (Q1058863) (← links)
• Equivalence of infinite behavior of finite automata (Q1060562) (← links)
• Langages infinitaires et produit de mixage (Q1061496) (← links)
• Towards a formal proof system for \(\omega\)-rational expressions (Q1064076) (← links)
• Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices (Q1068544) (← links)
• Description and reasoning of VLSI circuit in temporal logic (Q1075756) (← links)
• Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions (Q1079373) (← links)
• The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
• Finitely generated \(\omega\)-languages (Q1092671) (← links)
• On generators of rational \(\omega\)-power languages (Q1095674) (← links)
• On a subclass of \(\infty\)-regular languages (Q1104761) (← links)
• Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) (Q1105050) (← links)
• Complementing deterministic Büchi automata in polynomial time (Q1116702) (← links)
• An automata theoretic decision procedure for the propositional mu- calculus (Q1119630) (← links)
• Characterization and closure properties of linear \(\omega\)-languages (Q1127314) (← links)
• On the complexity of \(\omega\)-type Turing acceptors (Q1138912) (← links)
• Generalized automata on infinite trees and Muller-McNaughton's theorem (Q1178688) (← links)
• Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems (Q1179180) (← links)
• Finitely generated bi\(\omega\)-languages (Q1183567) (← links)
• On automata on infinite trees (Q1186604) (← links)
• Finite automata on directed graphs (Q1191024) (← links)
• A denotational theory of synchronous reactive systems (Q1193599) (← links)
• Fairness, distances and degrees (Q1193862) (← links)
• Alternating automata, the weak monadic theory of trees and its complexity (Q1193871) (← links)