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

descriptionPublicationkeyboard_double_arrow_right Article 01 Nov 2020 English Publisher:World Scientific Pub Co Pte LtJournal:New Mathematics and Natural Computation, volume 16, pages 481-496 (issn: 1793-0057, eissn: 1793-7027,

Copyright policy )

Authors: Priyanka Pal; S. P. Tiwari;

doi: 10.1142/s1793005720500295

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

- Summary
- Related research
  (1)
- Metrics

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 [Formula: see text]-valued multiset regular languages. In between, we associate two deterministic [Formula: see text]-valued multiset automata with a given deterministic [Formula: see text]-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 [Formula: see text]-valued multiset automata.

Related Organizations

Indian Institutes of Technology
India

1 Research products, page 1 of 1

CoReach
2017IsAmongTopNSimilarDocuments

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	8
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%