Multiset Languages Accepted by Deterministic Multiset Finite Automata with Detection as a Specific Kind of Semilinear Languages

被引：0
作者：
Martinek, Pavel [1 ]
机构：
[1] Tomas Bata Univ Zlin, Dept Math, Nam TG Masaryka 5555, Zlin 76001, Czech Republic
来源：
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2016 (ICNAAM-2016) | 2017年 / 1863卷
关键词：
D O I：
10.1063/1.4992717
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The class of multiset languages accepted by deterministic multiset finite automata with detection is strictly included in the class of multiset regular languages. Since multiset regular languages coincide with semilinear languages, the strict inclusion means that some restrictive conditions imposed to semilinear languages can narrow them appropriately. The paper provides a condition which is expressed with help of semilinear languages and which is necessary for the multiset languages accepted by deterministic multiset finite automata with detection.
引用
收藏
页数：4
相关论文
共 50 条
[31]   Topological Approaches in Characterization of Algebraic Structure of Fuzzy Multiset Finite Automata [J].
Ruhela, Shainky ;
Verma, Sunny ;
Yadav, Vijay Kumar ;
Tiwari, S. P. .
NEW MATHEMATICS AND NATURAL COMPUTATION, 2024,
[32]   FINITE AUTOMATA AND UNARY LANGUAGES [J].
CHROBAK, M .
THEORETICAL COMPUTER SCIENCE, 1986, 47 (02) :149-158
[33]   COVER AUTOMATA FOR FINITE LANGUAGES [J].
Salomaa, Arto ;
Yu, Sheng .
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2007, (92) :65-74
[34]   ON THE CLASSES OF LANGUAGES ACCEPTED BY LIMITED CONTEXT RESTARTING AUTOMATA [J].
Otto, Friedrich ;
Cerno, Peter ;
Mraz, Frantisek .
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2014, 48 (01) :61-84
[35]   AN ORDERING ON WORDS IN RELATION WITH LANGUAGES ACCEPTED BY INVOLUTIVE AUTOMATA [J].
POUZET, M ;
SAIDANE, F .
COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1994, 318 (11) :1047-1052
[36]   OMEGA-LANGUAGES ACCEPTED BY FINITE AUTOMATA WHOSE STRUCTURES ARE CASCADE PRODUCTS OF RESETS [J].
MORIYA, T .
INFORMATION SCIENCES, 1992, 61 (1-2) :179-186
[37]   Non-deterministic cellular automata and languages [J].
Kutrib, Martin .
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2012, 41 (06) :555-568
[38]   On regular tree languages and deterministic pushdown automata [J].
Janousek, Jan ;
Melichar, Borivoj .
ACTA INFORMATICA, 2009, 46 (07) :533-547
[39]   ON COMPARING PROBABILISTIC AND DETERMINISTIC AUTOMATA COMPLEXITY OF LANGUAGES [J].
ABLAYEV, FM .
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 379 :599-605
[40]   Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages [J].
Kawasaki, Yoshito ;
Hendrian, Diptarama ;
Yoshinaka, Ryo ;
Shinohara, Ayumi .
SOFSEM 2024: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2024, 14519 :340-354
12345