Pages that link to "Item:Q5586356"

The following pages link to Finite automata and the logic of one-place predicates (Q5586356):

Displaying 12 items.

• The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates (Q690498) (← links)
• Computability of analog networks (Q870263) (← links)
• Finite acceptance of infinite words (Q1269902) (← links)
• On syntactic congruences for \(\omega\)-languages (Q1391139) (← links)
• Automata over continuous time (Q1399970) (← links)
• Automata on finite trees (Q2074209) (← links)
• First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
• On decidability of monadic logic of order over the naturals extended by monadic predicates (Q2373700) (← links)
• Computability by monadic second-order logic (Q2656341) (← links)
• Automata and Logics for Concurrent Systems: Five Models in Five Pages (Q2947404) (← links)
• Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)
• (Q5009419) (← links)