Publikace UTB
Repozitář publikační činnosti UTB
Some notes to minimization of multiset finite automata
Repozitář DSpace/Manakin
Kontaktujte nás | Jazyk: čeština English
- Domovská stránka DSpace
- →
- Článek ve sborníku
- →
- Fakulta aplikované informatiky
- →
- Zobrazit záznam
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.title | Some notes to minimization of multiset finite automata | en |
| dc.contributor.author | Martinek, Pavel | |
| dc.relation.ispartof | AIP Conference Proceedings | |
| dc.identifier.issn | 0094-243X Scopus Sources, Sherpa/RoMEO, JCR | |
| dc.identifier.isbn | 978-0-7354-1690-1 | |
| dc.date.issued | 2018 | |
| utb.relation.volume | 1978 | |
| dc.event.title | International Conference of Numerical Analysis and Applied Mathematics, ICNAAM 2017 | |
| dc.event.location | Thessaloniki | |
| utb.event.state-en | Greece | |
| utb.event.state-cs | Řecko | |
| dc.event.sdate | 2017-09-25 | |
| dc.event.edate | 2017-09-30 | |
| dc.type | conferenceObject | |
| dc.language.iso | en | |
| dc.publisher | American Institute of Physics Inc. | |
| dc.identifier.doi | 10.1063/1.5044089 | |
| dc.relation.uri | https://aip.scitation.org/doi/abs/10.1063/1.5044089 | |
| dc.description.abstract | 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. © 2018 Author(s). | en |
| utb.faculty | Faculty of Applied Informatics | |
| dc.identifier.uri | http://hdl.handle.net/10563/1008110 | |
| utb.identifier.obdid | 43878923 | |
| utb.identifier.scopus | 2-s2.0-85049951349 | |
| utb.identifier.wok | 000445105400401 | |
| utb.source | d-scopus | |
| dc.date.accessioned | 2018-08-03T12:49:41Z | |
| dc.date.available | 2018-08-03T12:49:41Z | |
| utb.contributor.internalauthor | Martinek, Pavel | |
| utb.fulltext.affiliation | Pavel Martinek Department of Mathematics, Tomas Bata University in Zlin, nám. T. G. Masaryka 5555, 760 01 Zlín, Czech Republic pmartinek@fai.utb.cz | |
| utb.fulltext.dates | - | |
| utb.fulltext.references | [1] J. P. Banâtre, A. Coutant, and D. Le Metayer, “A parallel machine for multiset transformation and its programming 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 Mathematics (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. | |
| utb.fulltext.sponsorship | - | |
| utb.wos.affiliation | [Martinek, Pavel] Tomas Bata Univ Zlin, Dept Math, Nam TG Masaryka 5555, Zlin 76001, Czech Republic | |
| utb.scopus.affiliation | Department of Mathematics, Tomas Bata University in Zlin, Nám. T. G. Masaryka 5555, Zlín, Czech Republic | |
| utb.fulltext.projects | - |
