Pages that link to "Item:Q1361889"

The following pages link to Polynomial closure and unambiguous product (Q1361889):

Displaying 24 items.

• The globals of pseudovarieties of ordered semigroups containing<i>B</i>₂and an application to a problem proposed by Pin (Q4680724) (← links)
• Some results on<i>C</i>-varieties (Q4680738) (← links)
• Imre Simon: an exceptional graduate student (Q4680741) (← links)
• On Existentially First-Order Definable Languages and Their Relation to NP (Q4718893) (← links)
• PROFINITE METHODS IN SEMIGROUP THEORY (Q4786315) (← links)
• Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
• EQUATIONAL DESCRIPTIONS OF LANGUAGES (Q4923277) (← links)
• AROUND DOT-DEPTH ONE (Q4923283) (← links)
• (Q4988163) (← links)
• (Q4989409) (← links)
• (Q5002800) (← links)
• Separating Without Any Ambiguity. (Q5002824) (← links)
• The Quantifier Alternation Hierarchy of Synchronous Relations (Q5092389) (← links)
• (Q5155687) (← links)
• Representations of relatively free profinite semigroups, irreducibility, and order primitivity (Q5217888) (← links)
• One quantifier alternation in first-order logic with modular predicates (Q5245724) (← links)
• On fixed points of the lower set operator (Q5246510) (← links)
• (Q5376657) (← links)
• (Q5376662) (← links)
• THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS (Q5462667) (← links)
• Unambiguity in Automata Theory (Q5500675) (← links)
• The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies (Q6195308) (← links)
• All about unambiguous polynomial closure (Q6566598) (← links)
• The regular languages of first-order logic with one alternation (Q6649495) (← links)