Contexts on trajectories
暂无分享,去创建一个
Carlos Martín-Vide | Grzegorz Rozenberg | Arto Salomaa | Alexandru Mateescu | G. Rozenberg | A. Salomaa | C. Martín-Vide | A. Mateescu
[1] Manfred Kudlek,et al. Contextual Grammars with Distributed Catenation and Shuffle , 1997, FCT.
[2] Arto Salomaa,et al. Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.
[3] Gheorghe Paun,et al. Marcus Contextual Grammars , 1994, Bull. EATCS.
[4] Gheorghe Paun,et al. Contextual Grammars and Formal Languages , 1997, Handbook of Formal Languages.
[5] Solomon Marcus,et al. Algebraic Linguistics Analytical Models , 1967 .
[6] Manfred Kudlek,et al. An infinite hierarchy of mildly context-sensitive families of languages , 1998 .
[7] Grzegorz Rozenberg,et al. Shuue on Trajectories: Syntactic Constraints , 1998 .
[8] Oscar H. Ibarra,et al. Simple Matrix Languages , 1970, Inf. Control..
[9] Grzegorz Rozenberg,et al. Shuffle on Trajectories: Syntactic Constraints , 1998, Theor. Comput. Sci..
[10] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[11] Aravind K. Joshi,et al. Natural language parsing: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? , 1985 .
[12] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .
[13] Alexandru Mateescu,et al. Quasi shuffle Marcus grammars , 1996 .
[14] L. H. Haines. On free monoids partially ordered by embedding , 1969 .
[15] Danny Raz. Length Considerations in Context-Free Languages , 1997, Theor. Comput. Sci..
[16] Solomon Marcus,et al. Contextual Grammars and Natural Languages , 1997, Handbook of Formal Languages.
[17] Peter C. Chapin. Formal languages I , 1973, CSC '73.
[18] Solomon Marcus,et al. Contextual Grammars , 1969, COLING.
[19] Aravind K. Joshi,et al. Tree-Adjoining Grammars , 1997, Handbook of Formal Languages.