Stefano Varricchio (1960-2008) (Q2267786): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the factors of the Thue-Morse word on three symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test sets for languages of infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finiteness condition for finitely generated semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3493232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorial languages whose growth function is quadratically upper bounded / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(\omega\)-permutable semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem on $p$-power-free words and an application to semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizations of free monoids and unavoidable regularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some conditions on the product of two elements of a semigroup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness and iteration conditions for semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finiteness condition for semigroups generalizing a theorem of Hotzel / rank
 
Normal rank
Property / cites work
 
Property / cites work: On noncounting regular classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finitely recognizable semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regularity of languages on a binary alphabet generated by copying systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational series with coefficients in a commutative ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability of the equivalence problem for partially commutative rational power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Brown / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well quasi-orders and regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finiteness condition for semigroups generalizing a theorem of Coudrain and Schützenberger / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformly repetitive semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial properties of infinite words and applications to semigroup theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Behaviors of Automata from Multiplicity and Equivalence Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative pairs and multitape automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pumping Condition for Regular Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decisional problems on rational relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalization of Higman and Kruskal's theorems to regular languages and rational trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special factors and uniqueness conditions in rational trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words, univalent factors, and boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well quasi-orders and context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of the counting function of sparse context-free languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well quasi-orders, unavoidable sets, and derivation systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well Quasi Orders and the Shuffle Closure of Finite Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well quasi-orders generated by a word-shuffle rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separability of sparse context-free languages and of bounded rational relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5192680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well Quasi-orders in Formal Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parikh counting functions of sparse context-free languages are quasi-polynomials / rank
 
Normal rank

Latest revision as of 11:54, 2 July 2024

scientific article
Language Label Description Also known as
English
Stefano Varricchio (1960-2008)
scientific article

    Statements

    Stefano Varricchio (1960-2008) (English)
    0 references
    0 references
    2 March 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers