Affiliation:
1. Department of Mathematics & Computing, Indian Institute of Technology (ISM), Dhanbad 826004, India
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.
Funder
SERB, Ministry of Science & Technology, DST, Government of India
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Computer Science Applications,Human-Computer Interaction
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献