Multiset languages accepted by deterministic multiset finite automata with detection as a specific kind of semilinear languages
| Autor: | Pavel Martinek |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
Multiset Class (set theory) Mathematics::Combinatorics Nested word Finite-state machine Regular language Mathematics::Analysis of PDEs Computer Science::Programming Languages Abstract family of languages Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) Computer Science::Formal Languages and Automata Theory Mathematics |
| Zdroj: | AIP Conference Proceedings. |
| ISSN: | 0094-243X |
| DOI: | 10.1063/1.4992717 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|