The paper deals with minimization of multiset finite automata. It is shown that in case of deterministic multiset finite automata whose transitions satisfy certain conditions based on lexicographic ordering, the resulting minimal automaton is unique up to isomorphism. On the other hand, no such unique minimal automaton exists in case of nondeterministic multiset finite automata.
REFERENCES
1.
J. P.
Banâtre
, A.
Coutant
, and D.
Le Metayer
, “A parallel machine for multiset transformation and its program- ming style
,” Future Generation Computer Systems
, vol. 4
, no. 2
, pp. 133
–144
, 1988
.2.
G.
Berry
, G.
Boudol
, “The chemical abstract machine
,” Theor. Comp. Sci.
, vol. 96
, pp. 217
–248
, 1992
.3.
W. D.
Blizard
, “Multiset theory
,” Notre Dame J. Form. Log.
, vol. 30
, no. 1
, pp. 36
–66
, 1989
.4.
W. D.
Blizard
, “The development of multiset theory
,” Mod. Log.
, vol. 1
, no. 4
, pp. 319
–352
, 1991
.5.
E.
Csuhaj-Varjú
, C.
Martίn-Vide
, and V.
Mitrana
, “Multiset automata
,” in Multiset processing — mathematical, computer science, and molecular computing points of view
, C. S.
Calude
, G.
Păun
, G.
Rozenberg
, and A.
Salomaa
, Eds., Lecture notes in computer science
, vol. 2235
, Berlin
: Springer
, 2001
, pp. 69
–83
.6.
J. E.
Hopcroft
, R.
Motwani
, and J. D.
Ullman
, Introduction to Automata Theory, Languages, and Computation
, 2nd ed., Upper Saddle River
: Pearson Addison Wesley
, 2003
.7.
M.
Kudlek
, C.
Martίn-Vide
, and G.
Păun
, “Toward a formal macroset theory
,” in Multiset processing — mathematical, computer science, and molecular computing points of view
, C. S.
Calude
, G.
Păun
, G.
Rozenberg
, and A.
Salomaa
, Eds., Lecture notes in computer science
, vol. 2235
, Berlin
: Springer
, 2001
, pp. 123
–133
.8.
M.
Kudlek
, P.
Totzke
, and G.
Zetsche
, “Multiset pushdown automata
,” Fund. Inf.
, vol. 93
, pp. 221
–233
, 2009
.9.
M.
Kudlek
, P.
Totzke
, and G.
Zetsche
, “Properties of Multiset language classes defined by multiset pushdown automata
,” Fund. Inf.
, vol. 93
, pp. 235
–244
, 2009
.10.
P.
Martinek
, “Multiset languages accepted by deterministic multiset finite automata with detection as a specific kind of semilinear languages
,” in International Conference of Numerical Analysis and Applied Mathe- matics (ICNAAM 2016)
, T.
Simos
and Ch.
Tsitouras
, Eds., AIP Conference proceedings
1863
, 560034
(2017
).11.
A.
Meduna
, Formal Languages and Computation: Models and Their Applications
, CRC Press
, Boca Raton
, 2014
.12.
G.
Păun
, G.
Rozenberg
, and A.
Salomaa
, DNA Computing. New computing paradigms
, Springer-Verlag
, Berlin
, 1998
.13.
M.
Sipser
, Introduction to the Theory of Computation
, 2nd ed., Boston
: Thomson Course Technology
, 2006
.
This content is only available via PDF.
© 2018 Author(s).
2018
Author(s)
You do not currently have access to this content.
