Pages that link to "Item:Q1817074"

The following pages link to Logic, semigroups and automata on words (Q1817074):

Displaying 16 items.

• Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
• Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
• A note on partially ordered tree automata (Q975463) (← links)
• Polynomial closure of group languages and open sets of the Hall topology (Q1349899) (← links)
• Polynomial closure and unambiguous product (Q1361889) (← links)
• Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
• Algebraic tools for the concatenation product. (Q1853747) (← links)
• Star-free sets of words on ordinals (Q1854423) (← links)
• Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
• On ideals of quasi-commutative semigroups (Q2414185) (← links)
• Locally finite ω-languages and effective analytic sets have the same topological complexity (Q2827947) (← links)
• Theme and Variations on the Concatenation Product (Q3014930) (← links)
• The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
• On the Topological Complexity of Infinitary Rational Relations (Q4825475) (← links)
• Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations (Q4825476) (← links)
• A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I (Q5321775) (← links)