Pumping lemmata for multiset languages accepted by multiset finite automata with and without detection

Martinek, Pavel

Title:

Author:

Martinek, Pavel

Document type:

Conference paper (English)

Source document:

AIP Conference Proceedings. 2025, vol. 3315

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:

9780735446496

DOI:

https://doi.org/10.1063/5.0286669

Abstract:

Families of multiset languages accepted by deterministic multiset finite automata with detection, deterministic and nondeterministic multiset finite automata without detection differ. However, the only published pumping lemma concerning all these languages is the same. The paper describes several forms of pumping lemmata which can distinguish some of the different multiset languages.

Full text:

https://pubs.aip.org/aip/acp/article-abstract/3315/1/170001/3363120/Pumping-lemmata-for-multiset-languages-accepted-by

Show full item record

Files in this item

Files	Size	Format	View
There are no files associated with this item.

ČSN ISO 690:2011 citation

Citace článku v konferenčním sborníku:
MARTINEK, Pavel. Pumping lemmata for multiset languages accepted by multiset finite automata with and without detection. In: AIP Conference Proceedings [online]. Heraklion: American Institute of Physics, 2025 [cit. 2026-03-09]. ISSN 0094-243X. Dostupné z: https://pubs.aip.org/aip/acp/article-abstract/3315/1/170001/3363120/Pumping-lemmata-for-multiset-languages-accepted-by.

These citations are software generated and may contain errors. To verify accuracy, check the appropriate style guide.