Pages that link to "Item:Q1391139"

The following pages link to On syntactic congruences for \(\omega\)-languages (Q1391139):

Displaying 21 items.

• Learning regular omega languages (Q329611) (← links)
• Efficient minimization of deterministic weak \(\omega\)-automata (Q1603452) (← links)
• Inferring regular languages and \(\omega\)-languages (Q1648037) (← links)
• The disjunctivities of \(\omega\)-languages. (Q1811081) (← links)
• Regular \(\omega\)-languages with an informative right congruence (Q2029605) (← links)
• Shift-invariant topologies for the Cantor space \(X^{\omega}\) (Q2357113) (← links)
• Relating word and tree automata (Q2576943) (← links)
• Automata Theory and Model Checking (Q3176362) (← links)
• (Q3384896) (← links)
• Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
• Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) (Q3540195) (← links)
• (Q4603446) (← links)
• First-Order Logic and Numeration Systems (Q4613547) (← links)
• TYPENESS FOR ω-REGULAR AUTOMATA (Q5484907) (← links)
• (Q5875345) (← links)
• A Myhill-Nerode theorem for register automata and symbolic trace languages (Q5918650) (← links)
• On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words (Q6094518) (← links)
• Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs (Q6566586) (← links)
• Constructing deterministic parity automata from positive and negative examples (Q6586928) (← links)
• Half-positional objectives recognized by deterministic Büchi automata (Q6597970) (← links)
• Kleene theorems for lasso languages and \(\omega \)-languages (Q6636074) (← links)