The following pages link to (Q3776657):
Displaying 50 items.
- Schützenberger and Eilenberg theorems for words on linear orderings (Q414913) (← links)
- Varieties and rational functions (Q673101) (← links)
- An undecidable problem about rational sets and contour words of polyominoes (Q751298) (← links)
- On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics (Q751686) (← links)
- A language theoretic interpretation of the Schützenberger representations with applications to certain varieties of languages (Q795178) (← links)
- Two algebraic approaches to variants of the concatenation product (Q861283) (← links)
- Products of languages with counter (Q917324) (← links)
- A characterization of s-languages (Q1029050) (← links)
- On varieties of rational languages and variable length codes. II (Q1079669) (← links)
- Groups in the syntactic monoid of a composed code (Q1081706) (← links)
- Addition molle et fonctions p-locales (Q1083868) (← links)
- On some equations in free partially commutative monoids (Q1084189) (← links)
- First-order logic and star-free sets (Q1088982) (← links)
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) (Q1105050) (← links)
- Membership testing in commutative transformation semigroups (Q1108790) (← links)
- Partially ordered finite monoids and a theorem of I. Simon (Q1111705) (← links)
- Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups) (Q1118045) (← links)
- Programs over aperiodic monoids (Q1122664) (← links)
- Inverse monoids of dot-depth two (Q1124363) (← links)
- Results on homomorphic realization of automata by \(\alpha_ 0\)-products (Q1177141) (← links)
- Polynomial operations and hierarchies of concatenation (Q1183588) (← links)
- AUTOMATE, a computing package for automata and finite semigroups (Q1186737) (← links)
- Varieties of finite monoids and Büchi-McNaughton theorem (Q1193885) (← links)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids (Q1262959) (← links)
- Languages recognized by finite aperiodic groupoids (Q1274931) (← links)
- Varieties and pseudovarieties of ordered normal bands (Q1293379) (← links)
- Free profinite \(\mathcal R\)-trivial, locally idempotent and locally commutative semigroups (Q1293384) (← links)
- Equations and monoid varieties of dot-depth one and two (Q1314381) (← links)
- On a complete set of generators for dot-depth two (Q1324687) (← links)
- Rabin tree automata and finite monoids (Q1341736) (← links)
- Over testable languages (Q1351950) (← links)
- Covers for monoids. (Q1421817) (← links)
- \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata (Q1575552) (← links)
- Families of locally testable languages (Q1575558) (← links)
- Right and left locally testable languages (Q1583588) (← links)
- Logic over words on denumerable ordinals (Q1604197) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- Games, equations and the dot-depth hierarchy (Q1823928) (← links)
- Decomposition techniques for finite semigroups, using categories. I (Q1825289) (← links)
- Algebraic tools for the concatenation product. (Q1853747) (← links)
- Bilateral locally testable languages. (Q1874423) (← links)
- Function composition and automatic average case analysis (Q1894000) (← links)
- On the Burnside problem for semigroups of matrices in the \((\max,+)\) algebra (Q1914078) (← links)
- Petri net languages and infinite subsets of \(\mathbb{N}^m\) (Q1970198) (← links)
- Representations and identities of plactic-like monoids (Q2144403) (← links)
- Recognizable subsets of some partially Abelian monoids (Q2266128) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- Regular splicing languages and subclasses (Q2484444) (← links)
- Linear splicing and syntactic monoid (Q2489941) (← links)
