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 条

[21] Characterization of lattice-valued multiset finite automata
Dubey, M. K.
Singh, Anand P.
Dhingra, Mallika
GRANULAR COMPUTING, 2022, 7 (04) : 821 - 836
[22] On the parallelizability of languages accepted by P automata
Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende utca 13-17, Budapest 1111, Hungary
Lect. Notes Comput. Sci., (170-178):
[23] Languages Accepted by Weighted Restarting Automata
Wang, Qichao
FUNDAMENTA INFORMATICAE, 2021, 180 (1-2) : 151 - 177
[24] Regular languages accepted by quantum automata
Bertoni, A
Carpentieri, M
INFORMATION AND COMPUTATION, 2001, 165 (02) : 174 - 182
[25] Learning regular languages using non deterministic finite automata
Denis, F
Lemay, A
Terlutte, A
GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2000, 1891 : 39 - 50
[26] Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy
Okubo, Fumiya
Yokomori, Takashi
FUNDAMENTA INFORMATICAE, 2015, 138 (1-2) : 31 - 44
[27] Deterministic pushdown automata and unary languages
Pighizzini, Giovanni
IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 232 - 241
[28] DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
Pighizzini, Giovanni
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2009, 20 (04) : 629 - 645
[29] RECOGNITION OF LANGUAGES BY FINITE MULTI-HEAD PROBABILISTIC AND DETERMINISTIC AUTOMATA
FREIVALDS, RV
AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1979, (03): : 15 - 20
[30] Algebraic properties of intuitionistic L-fuzzy multiset finite automata
Wang, Yongbing
Zhang, Lixia
SOFT COMPUTING, 2021, 25 (22) : 13857 - 13867

← 1 2 3 4 5 →