Pages that link to "Item:Q4302805"
From MaRDI portal
The following pages link to The membership problem in aperiodic transformation monoids (Q4302805):
Displaying 12 items.
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- Languages recognized by finite aperiodic groupoids (Q1274931) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- On the computational power of programs over \(\mathsf{BA}_2\) monoid (Q2232262) (← links)
- Two-letter group codes that preserve aperiodicity of inverse finite automata. (Q2480773) (← links)
- Learning expressions and programs over monoids (Q2490112) (← links)
- Deciding FO-definability of regular languages (Q2695357) (← links)
- Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
- The intersection problem for finite monoids (Q3304129) (← links)
- (Q5121913) (← links)
- The Intersection Problem for Finite Semigroups (Q5859649) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
