Pages that link to "Item:Q1150445"

The following pages link to A generalization of the Schützenberger product of finite monoids (Q1150445):

Displaying 50 items.

• Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
• Gröbner-Shirshov bases of some monoids. (Q536241) (← links)
• Expansions, free inverse semigroups, and Schützenberger product (Q579420) (← links)
• Almost finite expansions of arbitrary semigroups (Q798447) (← links)
• Products of languages with counter (Q917324) (← links)
• An application of the matrix representation of transductions (Q1057659) (← links)
• A property of the Schützenberger product (Q1089109) (← links)
• Semigroups and languages of dot-depth two (Q1109125) (← links)
• Inverse monoids of dot-depth two (Q1124363) (← links)
• Classification of finite monoids: the language approach (Q1157412) (← links)
• Topologies for the free monoid (Q1173729) (← links)
• Games, equations and dot-depth two monoids (Q1201097) (← links)
• Closure of varieties of languages under products with counter (Q1201878) (← links)
• Some results on the dot-depth hierarchy (Q1207707) (← links)
• Trees, congruences and varieties of finite semigroups (Q1270818) (← links)
• Polynomial closure and unambiguous product (Q1361889) (← links)
• Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
• The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← links)
• Sur les monoides dont tous les groupes sont resolubles (Q1838586) (← links)
• Algebraic tools for the concatenation product. (Q1853747) (← links)
• Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
• Characterizing level one in group-based concatenation hierarchies (Q2097235) (← links)
• State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
• Machines that can output empty words (Q2272215) (← links)
• Generic results for concatenation hierarchies (Q2311891) (← links)
• Concatenation hierarchies: new bottle, old wine (Q2399361) (← links)
• The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy (Q2411037) (← links)
• Languages of dot-depth 3/2 (Q2480745) (← links)
• Alternation Hierarchies of First Order Logic with Regular Predicates (Q2947877) (← links)
• Theme and Variations on the Concatenation Product (Q3014930) (← links)
• A conjecture on the concatenation product (Q3147025) (← links)
• An application of the Ehrenfeucht-Fraisse game in formal language theory (Q3347321) (← links)
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS (Q3538848) (← links)
• Representation theory of finite semigroups, semigroup radicals and formal language theory (Q3617621) (← links)
• (Q3913600) (← links)
• Sur le produit avec compteur modulo un nombre premier (Q4032305) (← links)
• Irreducibility of certain pseudovarieties¹ (Q4395729) (← links)
• Separating regular languages with two quantifier alternations (Q4558789) (← links)
• Complete rewriting system for the Schützenberger product of n groups (Q4621410) (← links)
• The product of rational languages (Q4630281) (← links)
• IDEMPOTENT POINTLIKE SETS (Q4658707) (← links)
• The globals of pseudovarieties of ordered semigroups containing<i>B</i>₂and an application to a problem proposed by Pin (Q4680724) (← links)
• On The Schützenberger Product of Three Copies of a Free Group (Q4704556) (← links)
• Schützenberger-like products in non-free monoids (Q4850325) (← links)
• AROUND DOT-DEPTH ONE (Q4923283) (← links)
• (Q4989409) (← links)
• (Q5155687) (← links)
• (Q5184421) (← links)
• One quantifier alternation in first-order logic with modular predicates (Q5245724) (← links)
• Presentations of the Schützenberger Product of <i>n</i> Groups (Q5469989) (← links)