The following pages link to Cônes rationnels commutatifs (Q1133330):
Displaying 21 items.
- The effect of end-markers on counter machines and commutativity (Q265080) (← links)
- On regularity of context-free languages (Q759489) (← links)
- Rational languages and the Burnside problem (Q1079380) (← links)
- Literal shuffle (Q1098321) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- A result concerning the trios generated by commutative SLIP-languages (Q1169298) (← links)
- Semicommutations and algebraic languages (Q1199527) (← links)
- Remarks about commutative context-free languages (Q1267720) (← links)
- Algebraic languages and polyominoes enumeration (Q1348529) (← links)
- The commutative closure of a binary slip-language is context-free: A new proof. (Q1414244) (← links)
- Refining the hierarchy of blind multicounter languages and twist-closed trios. (Q1427852) (← links)
- On some bounded semiAFLs and AFLs (Q1837538) (← links)
- Langages à un compteur (Q1838045) (← links)
- Enhancement of automata with jumping modes (Q2278568) (← links)
- MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies (Q2353402) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- On the usefulness of bifaithful rational cones (Q3741081) (← links)
- On some transducer equivalence problems for families of languages (Q3806848) (← links)
- Every commutative quasirational language is regular (Q4728278) (← links)
- Semi-trace morphisms and rational transductions (Q5096739) (← links)
- The effect of jumping modes on various automata models (Q6155031) (← links)
