Stefano Varricchio (1960-2008)
From MaRDI portal
Publication:2267786
DOI10.1007/s00233-009-9201-xzbMath1183.01040OpenAlexW1980348184MaRDI QIDQ2267786
Publication date: 2 March 2010
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00233-009-9201-x
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Well quasi-orders and context-free grammars
- On finitely recognizable semigroups
- Well quasi-orders generated by a word-shuffle rewriting
- Factorizations of free monoids and unavoidable regularities
- On the separability of sparse context-free languages and of bounded rational relations
- The Parikh counting functions of sparse context-free languages are quasi-polynomials
- Test sets for languages of infinite words
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Factorial languages whose growth function is quadratically upper bounded
- A finiteness condition for semigroups generalizing a theorem of Hotzel
- Finiteness and iteration conditions for semigroups
- On noncounting regular classes
- On the decidability of the equivalence problem for partially commutative rational power series
- Rational series with coefficients in a commutative ring
- On the regularity of languages on a binary alphabet generated by copying systems
- On a conjecture of Brown
- A note on \(\omega\)-permutable semigroups
- On uniformly repetitive semigroups
- Well quasi-orders and regular languages
- A finiteness condition for semigroups generalizing a theorem of Coudrain and Schützenberger
- Some decisional problems on rational relations
- On the generalization of Higman and Kruskal's theorems to regular languages and rational trees
- Words, univalent factors, and boxes
- On the factors of the Thue-Morse word on three symbols
- Some conditions on the product of two elements of a semigroup
- Some combinatorial properties of infinite words and applications to semigroup theory
- On the structure of the counting function of sparse context-free languages.
- Well quasi-orders, unavoidable sets, and derivation systems
- A combinatorial theorem on $p$-power-free words and an application to semigroups
- Well Quasi-orders in Formal Language Theory
- Well Quasi Orders and the Shuffle Closure of Finite Sets
- COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS
- A Pumping Condition for Regular Sets
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Developments in Language Theory
- Iterative pairs and multitape automata
- A finiteness condition for finitely generated semigroups
- Special factors and uniqueness conditions in rational trees
This page was built for publication: Stefano Varricchio (1960-2008)
