Pumping Lemmata for Multiset Languages Accepted by Multiset Finite Automata With and Without Detection

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F25%3A63596938" target="_blank" >RIV/70883521:28140/25:63596938 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1063/5.0286669" target="_blank" >http://dx.doi.org/10.1063/5.0286669</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1063/5.0286669" target="_blank" >10.1063/5.0286669</a>

Result language

angličtina

Original language name

Pumping Lemmata for Multiset Languages Accepted by Multiset Finite Automata With and Without Detection

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

AIP Conference Proceedings

ISBN

978-0-7354-5245-9

ISSN

0094-243X

e-ISSN

1551-7616

Number of pages

4

Pages from-to

1-4

Publisher name

American Institute of Physics

Place of publication

Meville

Event location

Heraklion

Event date

Sep 11, 2023

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—