Sul l'inversion des morphisms d'arbres
暂无分享,去创建一个
[1] Max Dauchet,et al. Théorie des Magmoïdes (II) , 1979, RAIRO Theor. Informatics Appl..
[2] Alfred V. Aho,et al. Currents In The Theory Of Computing , 1973 .
[3] Max Dauchet,et al. Bi-transductions de forêts , 1976, International Colloquium on Automata, Languages and Programming.
[4] Masako Takahashi,et al. Rational relations of Binary Trees , 1977, ICALP.
[5] A. Arnold,et al. Un theoreme de Chomsky-Schützenberger pour les forets algebriques , 1977 .
[6] William Chesley Rounds. Trees, transducers, and transformations , 1968 .
[7] Maurice Nivat,et al. Transduction des langages de Chomsky , 1968 .
[8] M. Nivat. On the interpretation of recursive program schemes , 1974 .
[9] Walter S. Brainerd,et al. Tree Generating Regular Systems , 1969, Inf. Control..
[10] Masako Takahashi. Primitive Tranformations of Regular Sets and Recognizable Sets , 1972, ICALP.
[11] Seymour Ginsburg,et al. Studies In Abstract Families Of Languages , 1969 .
[12] Joffroy Beauquier,et al. Une caractérisation des générateurs standard , 1974, RAIRO Theor. Informatics Appl..
[13] William C. Rounds,et al. Compositions of n tree transducers , 1972, STOC.
[14] Max Dauchet,et al. Forêts Algébriques et Homomorphismes Inverses , 1978, Inf. Control..
[15] James W. Thatcher,et al. Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..
[16] Brenda S. Baker,et al. Tree transductions and families of tree languages , 1973, STOC.
[17] Michael J. Fischer,et al. Grammars with Macro-Like Productions , 1968, SWAT.
[18] Luc Boasson. on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages , 1975, MFCS.
[19] Michel Latteux,et al. Cônes Rationnels Commutativement Clos , 1977, RAIRO Theor. Informatics Appl..
[20] Seymour Ginsburg,et al. Principal AFL , 1970, J. Comput. Syst. Sci..
[21] Max Dauchet,et al. Transductions de Forets Reconnaissables Monadiques Forets Coregulieres , 1976, RAIRO Theor. Informatics Appl..
[22] Max Dauchet,et al. Un Théorème de Duplication pour les Forêts Algébriques , 1976, J. Comput. Syst. Sci..
[23] William C. Rounds,et al. Context-free grammars on trees , 1969, STOC.
[24] William C. Rounds,et al. Tree-oriented proofs of some theorems on context-free and indexed languages , 1970, STOC.