Multiset languages accepted by deterministic multiset finite automata with detection as a specific kind of semilinear languages

Martinek, Pavel

Název:

Autor:

Martinek, Pavel

Typ dokumentu:

Článek ve sborníku (English)

Zdrojový dok.:

AIP Conference Proceedings. 2017, vol. 1863

ISSN:

0094-243X (Sherpa/RoMEO, JCR)

Journal Impact This chart shows the development of journal-level impact metrics in time

JCR	Journal Citation Reports - Impact Factor
SNIP	SCImago Source Normalized Impact per Paper
SJR	SCImago Journal Rank
IPP	SCImago Impact per Publication
CS	Scopus CiteScore

(Note: The metrics are not comparable against one another.)

ISBN:

978-0-7354-1538-6

DOI:

https://doi.org/10.1063/1.4992717

Abstrakt:

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. © 2017 Author(s).

Plný text:

http://aip.scitation.org/doi/pdf/10.1063/1.4992717

Zobrazit celý záznam

Soubory tohoto záznamu

Název: Fulltext_1007298.pdf

Velikost: 104.2Kb

Formát: PDF

Popis: fulltext

Citace ČSN ISO 690:2011

Citace článku v konferenčním sborníku:
MARTINEK, Pavel. Multiset languages accepted by deterministic multiset finite automata with detection as a specific kind of semilinear languages. In: AIP Conference Proceedings [online]. Rhodes: American Institute of Physics (AIP), 2017 [cit. 2024-04-23]. ISSN 0094-243X. Dostupné z: http://aip.scitation.org/doi/pdf/10.1063/1.4992717.

Tyto citace vytvořil software a mohou obsahovat chyby. Pro ověření přesnosti si nastudujte příslušnou citační normu nebo příručku.