Stefano Varricchio (1960-2008)
From MaRDI portal
Publication:2267786
Cites work
- scientific article; zbMATH DE number 4166864 (Why is no real title available?)
- scientific article; zbMATH DE number 15264 (Why is no real title available?)
- scientific article; zbMATH DE number 177805 (Why is no real title available?)
- scientific article; zbMATH DE number 1206599 (Why is no real title available?)
- scientific article; zbMATH DE number 1256727 (Why is no real title available?)
- scientific article; zbMATH DE number 1259068 (Why is no real title available?)
- scientific article; zbMATH DE number 1301788 (Why is no real title available?)
- scientific article; zbMATH DE number 512865 (Why is no real title available?)
- scientific article; zbMATH DE number 679809 (Why is no real title available?)
- scientific article; zbMATH DE number 1047877 (Why is no real title available?)
- scientific article; zbMATH DE number 1962766 (Why is no real title available?)
- scientific article; zbMATH DE number 2040909 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 826074 (Why is no real title available?)
- scientific article; zbMATH DE number 1408342 (Why is no real title available?)
- scientific article; zbMATH DE number 5593047 (Why is no real title available?)
- A Pumping Condition for Regular Sets
- A combinatorial theorem on $p$-power-free words and an application to semigroups
- A finiteness condition for finitely generated semigroups
- A finiteness condition for semigroups generalizing a theorem of Coudrain and Schützenberger
- A finiteness condition for semigroups generalizing a theorem of Hotzel
- A note on \(\omega\)-permutable semigroups
- COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS
- Developments in Language Theory
- Factorial languages whose growth function is quadratically upper bounded
- Factorizations of free monoids and unavoidable regularities
- Finiteness and iteration conditions for semigroups
- Iterative pairs and multitape automata
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- On a conjecture of Brown
- On finitely recognizable semigroups
- On noncounting regular classes
- On the decidability of the equivalence problem for partially commutative rational power series
- On the factors of the Thue-Morse word on three symbols
- On the generalization of Higman and Kruskal's theorems to regular languages and rational trees
- On the regularity of languages on a binary alphabet generated by copying systems
- On the separability of sparse context-free languages and of bounded rational relations
- On the structure of the counting function of sparse context-free languages.
- On uniformly repetitive semigroups
- Rational series with coefficients in a commutative ring
- Some combinatorial properties of infinite words and applications to semigroup theory
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Some conditions on the product of two elements of a semigroup
- Some decisional problems on rational relations
- Special factors and uniqueness conditions in rational trees
- Special factors in some combinatorial structures
- Test sets for languages of infinite words
- The Parikh counting functions of sparse context-free languages are quasi-polynomials
- Well Quasi Orders and the Shuffle Closure of Finite Sets
- Well Quasi-orders in Formal Language Theory
- Well quasi-orders and context-free grammars
- Well quasi-orders and regular languages
- Well quasi-orders generated by a word-shuffle rewriting
- Well quasi-orders, unavoidable sets, and derivation systems
- Words, univalent factors, and boxes
This page was built for publication: Stefano Varricchio (1960-2008)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267786)
