Multiset Automata

We propose a characterization of a Chomsky-like hierarchy of multiset grammars in terms of multiset automata. We also present the deterministic variants of all the automata investigated and prove that, unlike the string case, most of them are strictly less powerful than the nondeterministic variants. Some open problems and further directions of research are briefly discussed.

[1]  John S. McCaskill,et al.  Chemical evolution among artificial proto-cells , 2000 .

[2]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[3]  G Paun,et al.  Computing with Membranes (P Systems): Twenty Six Research Topics , 2000 .

[4]  Daniel Le Métayer,et al.  A parallel machine for multiset transformation and its programming style , 1988, Future Gener. Comput. Syst..

[5]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[6]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[7]  John E. Hopcroft,et al.  Scattered Context Grammars , 1969, J. Comput. Syst. Sci..

[8]  Michel Latteux,et al.  Cônes rationnels commutatifs , 1979, J. Comput. Syst. Sci..

[9]  Grzegorz Rozenberg,et al.  Handbook of formal languages, vol. 3: beyond words , 1997 .

[10]  Kim Marriott.  Constraint multiset grammars , 1994, Proceedings of 1994 IEEE Symposium on Visual Languages.

[11]  Martin Odersky,et al.  Building visual language parsers , 1991, CHI '91.