Category of L-valued Multiset Automata and Brzozowski’s Algorithm

Priyanka Pal () and S. P. Tiwari ()
Additional contact information
Priyanka Pal: Department of Mathematics & Computing, Indian Institute of Technology (ISM), Dhanbad 826004, India
S. P. Tiwari: Department of Mathematics & Computing, Indian Institute of Technology (ISM), Dhanbad 826004, India

New Mathematics and Natural Computation (NMNC), 2020, vol. 16, issue 03, 481-496

Abstract: The purpose of this work is to use the concepts of reachability and coreachability maps to provide a solution of a well-known characterization for L-valued multiset regular languages. In between, we associate two deterministic L-valued multiset automata with a given deterministic L-valued multiset automaton (DLMA) and show that the reachability and coreachability maps of the given DLMA turn out to be morphisms in the category of deterministic L-valued multiset automata.

Keywords: Deterministic L-valued multiset automaton; L-valued multiset language; homomorphism; reachability map; coreachability map; minimal realization; Brzozowski’s algorithm (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S1793005720500295
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:nmncxx:v:16:y:2020:i:03:n:s1793005720500295

Ordering information: This journal article can be ordered from

DOI: 10.1142/S1793005720500295

Access Statistics for this article

New Mathematics and Natural Computation (NMNC) is currently edited by Paul P Wang

More articles in New Mathematics and Natural Computation (NMNC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().