Pages that link to "Item:Q1157412"
From MaRDI portal
The following pages link to Classification of finite monoids: the language approach (Q1157412):
Displaying 50 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- On semidirect products of two finite semilattices (Q786232) (← links)
- Non-uniform automata over groups (Q804303) (← links)
- Products of languages with counter (Q917324) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Partially ordered finite monoids and a theorem of I. Simon (Q1111705) (← links)
- Closure of varieties of languages under products with counter (Q1201878) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← links)
- Algebraic tools for the concatenation product. (Q1853747) (← links)
- Languages defined with modular counting quantifiers (Q1854424) (← links)
- Some complexity results for polynomial rational expressions. (Q1874419) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Varieties (Q2074217) (← 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)
- Finite semigroup varieties of the form V*D (Q2266068) (← links)
- Machines that can output empty words (Q2272215) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- Languages and formations generated by \(D_4\) and \(Q_8\) (Q2333833) (← 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)
- Efficiency of automata in semi-commutation verification techniques (Q3515458) (← links)
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS (Q3538848) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Varieties of finite categories (Q3748457) (← links)
- Sur le produit avec compteur modulo un nombre premier (Q4032305) (← links)
- On Shuffle Ideals (Q4405554) (← links)
- (Q4453869) (← links)
- Separating regular languages with two quantifier alternations (Q4558789) (← links)
- The pseudovariety of semigroups of triangular matrices over a finite field (Q4680725) (← links)
- Imre Simon: an exceptional graduate student (Q4680741) (← links)
- AROUND DOT-DEPTH ONE (Q4923283) (← links)
- (Q4989409) (← links)
- (Q5155687) (← links)
- On Rough Approximations of Languages under Infinite Index Indiscernibility Relations (Q5164858) (← links)
- The Power of Diversity (Q5200079) (← links)
- One quantifier alternation in first-order logic with modular predicates (Q5245724) (← links)
- (Q5376657) (← links)
- Circuit complexity of regular languages (Q5895106) (← links)
- Circuit complexity of regular languages (Q5918477) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
