The following pages link to (Q3769981):
Displayed 50 items.
- Primitive morphisms (Q293147) (← links)
- On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups (Q329726) (← links)
- Regular languages and partial commutations (Q391641) (← links)
- Size lower bounds for quantum automata (Q403023) (← links)
- Language theoretical properties of hairpin formations (Q418760) (← links)
- Upper set monoids and length preserving morphisms (Q436105) (← links)
- On the word problem for syntactic monoids of piecewise testable languages. (Q444643) (← links)
- Closures of regular languages for profinite topologies. (Q467504) (← links)
- Unary enhancements of inherently non-finitely based semigroups. (Q467506) (← links)
- The dual equivalence of equations and coequations for automata (Q498397) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Bilateral semidirect product decompositions of transformation monoids. (Q535232) (← links)
- Fragments of first-order logic over infinite words (Q537914) (← links)
- Inverse semigroups and varieties of finite semigroups (Q579421) (← links)
- Deletion along trajectories (Q596097) (← links)
- Varieties of recognizable tree series over fields (Q627171) (← links)
- Piecewise testable languages via combinatorics on words (Q641179) (← links)
- Normal forms under Simon's congruence (Q667852) (← links)
- A note on the commutative closure of star-free languages (Q672729) (← links)
- An algebraic characterization of frontier testable tree languages (Q672861) (← links)
- Dynamical properties of PWD0L systems (Q673067) (← links)
- Semigroups of order preserving mappings on a finite chain: A new class of divisors (Q677105) (← links)
- Locally commutative power semigroups and counting factors of words (Q685456) (← links)
- Monoid varieties defined by \(x^{n+1}=x\) are local (Q688973) (← links)
- On deterministic finite automata and syntactic monoid size (Q703576) (← links)
- The expressive power of the shuffle product (Q710739) (← links)
- On the lattice of sub-pseudovarieties of DA. (Q711615) (← links)
- Burrows-Wheeler transformations and de Bruijn words (Q714849) (← links)
- Non-uniform automata over groups (Q804303) (← links)
- Sequential machines realized by group representations (Q807027) (← links)
- State complexity of projection on languages recognized by permutation automata and commuting letters (Q832938) (← links)
- Complexity of the identity checking problem for finite semigroups. (Q843593) (← links)
- Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364) (← links)
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts. (Q869222) (← links)
- Recognizing splicing languages: syntactic monoids and simultaneous pumping (Q881578) (← links)
- Tree algebras and varieties of tree languages (Q884456) (← links)
- The representation theory of the monoid of all partial functions on a set and related monoids as EI-category algebras. (Q906877) (← links)
- On the varieties of languages associated with some varieties of finite monoids with commuting idempotents (Q913522) (← links)
- Semidirectly closed pseudovarieties of locally trivial semigroups (Q923132) (← links)
- The automata that define representations of monomial algebras. (Q930352) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- On varieties of meet automata (Q955003) (← links)
- Infinite-vertex free profinite semigroupoids and symbolic dynamics. (Q1004467) (← links)
- On locally reversible languages (Q1034616) (← links)
- Locally trivial categories and unambiguous concatenation (Q1103056) (← links)
- On a conjecture of Rhodes (Q1120685) (← links)
- Topologies for the free monoid (Q1173729) (← links)
- Languages and scanners (Q1177931) (← links)
- On iterated semidirect products of finite semilattices (Q1178869) (← links)
- Modal functions for concise definition of state machines and products (Q1183435) (← links)