The following pages link to (Q4077455):
Displayed 50 items.
- Over testable languages (Q1351950) (← links)
- Monoids respecting \(n\)-chains of intervals (Q1355653) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- A proof of Simon's theorem on piecewise testable languages (Q1391537) (← links)
- Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. (Q1401334) (← links)
- An efficient null-free procedure for deciding regular language membership (Q1575893) (← links)
- LANGAGE: A Maple package for automaton characterization of regular languages (Q1575906) (← links)
- Right and left locally testable languages (Q1583588) (← links)
- The word problem for omega-terms over the Trotter-Weil hierarchy (Q1635816) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups (Q1731800) (← links)
- Computing finite semigroups (Q1757008) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Games, equations and the dot-depth hierarchy (Q1823928) (← 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)
- Bilateral locally testable languages. (Q1874423) (← links)
- The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups (Q1905975) (← links)
- Inclusion relations between some congruences related to the dot-depth hierarchy (Q1917345) (← links)
- Finite basis problem for involution monoids of unitriangular Boolean matrices (Q1987544) (← links)
- Subsequence versus substring constraints in sequence pattern languages (Q2022305) (← links)
- Schreier split extensions of preordered monoids (Q2035656) (← links)
- Varieties (Q2074217) (← links)
- Characterizing level one in group-based concatenation hierarchies (Q2097235) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q2112180) (← links)
- On Simon's congruence closure of a string (Q2112187) (← links)
- State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
- First-order logic and its infinitary quantifier extensions over countable words (Q2140479) (← links)
- Identities of the stylic monoid (Q2163879) (← links)
- Measuring power of locally testable languages (Q2164008) (← links)
- Learning from positive and negative examples: dichotomies and parameterized algorithms (Q2169975) (← links)
- Finite semigroup varieties of the form V*D (Q2266068) (← links)
- Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon (Q2276995) (← links)
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy (Q2411037) (← links)
- Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data (Q2508967) (← links)
- On the index of Simon's congruence for piecewise testability (Q2512830) (← links)
- The structure of finite monoids satisfying the relation \(\mathcal R=\mathcal H\). (Q2514861) (← links)
- On the pseudovariety generated by all finite monoids satisfying \(\mathcal R=\mathcal H\). (Q2516602) (← links)
- Constructing divisions into power groups (Q2565999) (← links)
- Characterization of the pseudovariety generated by finite monoids satisfying \(\mathcal R=\mathcal H\). (Q2631310) (← links)
- Alternating complexity of counting first-order logic for the subword order (Q2687036) (← links)
- Absent subsequences in words (Q2695493) (← links)
- Syntactic semigroup problem for the semigroup reducts of affine near-semirings over Brandt semigroups (Q2806105) (← links)
- Quantifier Alternation for Infinite Words (Q2811342) (← links)