The following pages link to Stefano Varricchio (Q213204):
Displayed 50 items.
- (Q216334) (redirect page) (← links)
- Well quasi-orders and context-free grammars (Q703570) (← links)
- Quasi-polynomials, linear Diophantine equations and semi-linear sets (Q764313) (← links)
- On finitely recognizable semigroups (Q811558) (← links)
- Well quasi-orders generated by a word-shuffle rewriting (Q884464) (← links)
- Factorizations of free monoids and unavoidable regularities (Q910247) (← links)
- On bounded rational trace languages (Q970110) (← links)
- On the separability of sparse context-free languages and of bounded rational relations (Q995585) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
- Test sets for languages of infinite words (Q1113683) (← links)
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups (Q1119694) (← links)
- Factorial languages whose growth function is quadratically upper bounded (Q1120288) (← links)
- A finiteness condition for semigroups generalizing a theorem of Hotzel (Q1173706) (← links)
- Finiteness and iteration conditions for semigroups (Q1177143) (← links)
- On noncounting regular classes (Q1193624) (← links)
- On the decidability of the equivalence problem for partially commutative rational power series (Q1193904) (← links)
- Rational series with coefficients in a commutative ring (Q1194316) (← links)
- On the regularity of languages on a binary alphabet generated by copying systems (Q1205714) (← links)
- On a conjecture of Brown (Q1206790) (← links)
- A note on \(\omega\)-permutable semigroups (Q1262957) (← links)
- On uniformly repetitive semigroups (Q1328454) (← links)
- Well quasi-orders and regular languages (Q1338899) (← links)
- A finiteness condition for semigroups generalizing a theorem of Coudrain and Schützenberger (Q1341145) (← links)
- Some decisional problems on rational relations (Q1390853) (← links)
- On the generalization of Higman and Kruskal's theorems to regular languages and rational trees (Q1567204) (← links)
- Words, univalent factors, and boxes (Q1608945) (← links)
- On the factors of the Thue-Morse word on three symbols (Q1813107) (← links)
- Some conditions on the product of two elements of a semigroup (Q1813302) (← links)
- Some combinatorial properties of infinite words and applications to semigroup theory (Q1917528) (← links)
- On the structure of the counting function of sparse context-free languages. (Q2490812) (← links)
- (Q2708946) (← links)
- Well quasi-orders, unavoidable sets, and derivation systems (Q3421904) (← links)
- A combinatorial theorem on $p$-power-free words and an application to semigroups (Q3479530) (← links)
- (Q3493232) (← links)
- Well Quasi-orders in Formal Language Theory (Q3533001) (← links)
- Well Quasi Orders and the Shuffle Closure of Finite Sets (Q3617063) (← links)
- (Q3801787) (← links)
- (Q3977588) (← links)
- COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS (Q3994320) (← links)
- (Q4038682) (← links)
- (Q4209252) (← links)
- (Q4231020) (← links)
- (Q4247004) (← links)
- (Q4281562) (← links)
- (Q4311854) (← links)
- A Pumping Condition for Regular Sets (Q4337629) (← links)
- (Q4347955) (← links)
- (Q4418597) (← links)
- (Q4452065) (← links)
- (Q4858460) (← links)