暂无分享,去创建一个
Gwénaël Richomme | Flavio D'Alessandro | Stefano Varricchio | Flavio D'Alessandro | S. Varricchio | G. Richomme
[1] Flavio D'Alessandro,et al. Well quasi-orders and context-free grammars , 2004, Theor. Comput. Sci..
[2] David Haussler,et al. On Regularity of Context-Free Languages , 1983, Theor. Comput. Sci..
[3] M. Lothaire. Combinatorics on words: Bibliography , 1997 .
[4] Tero Harju,et al. On Quasi Orders of Words and the Confluence Property , 1998, Theor. Comput. Sci..
[5] David Haussler,et al. Another generalization of Higman's well quasi order result on Sigma* , 1985, Discret. Math..
[6] Michal Kunc,et al. Regular solutions of language inequalities and well quasi-orders , 2005, Theor. Comput. Sci..
[7] Aldo de Luca,et al. Well quasi-orders and regular languages , 1994, Acta Informatica.
[8] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .
[9] Matthias Jantzen,et al. Extending Regular Expressions with Iterated Shuffle , 1985, Theor. Comput. Sci..
[10] Lucian Ilie,et al. On Well Quasi Orders of Free Monoids , 1998, Theor. Comput. Sci..
[11] Lila Kari,et al. Shuffle and scattered deletion closure of languages , 2000, Theor. Comput. Sci..
[12] Michal Kunc. The Power of Commuting with Finite Sets of Words , 2006, Theory of Computing Systems.
[13] Flavio D'Alessandro,et al. Well quasi-orders, unavoidable sets, and derivation systems , 2006, RAIRO Theor. Informatics Appl..
[14] Joseph B. Kruskal,et al. The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept , 1972, J. Comb. Theory A.
[15] Aldo de Luca,et al. Finiteness and Regularity in Semigroups and Formal Languages , 1999, Monographs in Theoretical Computer Science An EATCS Series.
[16] Benedetto Intrigila,et al. On the generalization of Higman and Kruskal's theorems to regular languages and rational trees , 2000, Acta Informatica.
[17] Flavio D'Alessandro,et al. On Well Quasi-orders on Languages , 2003, Developments in Language Theory.
[18] Laurence Puel,et al. Using Unavoidable Set of Trees to Generalize Kruskal's Theorem , 1989, J. Symb. Comput..