Pumping Lemmata for Fuzzy Languages Accepted by Jumping and Right One-Way Jumping Fuzzy Finite Automata

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F24%3A63585398" target="_blank" >RIV/70883521:28140/24:63585398 - isvavai.cz</a>

Výsledek na webu

<a href="https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10760167" target="_blank" >https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10760167</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/SCISISIS61014.2024.10760167" target="_blank" >10.1109/SCISISIS61014.2024.10760167</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Pumping Lemmata for Fuzzy Languages Accepted by Jumping and Right One-Way Jumping Fuzzy Finite Automata

Popis výsledku v původním jazyce

Jumping finite automata represent an interesting kind of automata working discontinuously over their input. They can read any input symbol and jump without restrictions on any other (not yet processed) symbol. Right one-way jumping finite automata start their reading from the first symbol of the input word, their &apos;jumps&apos; can be performed only in the left-to-right direction and after reaching the end of the input word, they can resume from its left hand side. This modified specification (in deterministic and nondeterministic variants) leads to automata with different computational power. The paper deals with fuzzy versions of these automata and with pumping lemmata for fuzzy languages accepted by them.

Název v anglickém jazyce

Pumping Lemmata for Fuzzy Languages Accepted by Jumping and Right One-Way Jumping Fuzzy Finite Automata

Popis výsledku anglicky

Jumping finite automata represent an interesting kind of automata working discontinuously over their input. They can read any input symbol and jump without restrictions on any other (not yet processed) symbol. Right one-way jumping finite automata start their reading from the first symbol of the input word, their &apos;jumps&apos; can be performed only in the left-to-right direction and after reaching the end of the input word, they can resume from its left hand side. This modified specification (in deterministic and nondeterministic variants) leads to automata with different computational power. The paper deals with fuzzy versions of these automata and with pumping lemmata for fuzzy languages accepted by them.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2024

Kód důvěrnosti údajů

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

Název statě ve sborníku

2024 Joint 13th International Conference on Soft Computing and Intelligent Systems and 25th International Symposium on Advanced Intelligent Systems, SCIS and ISIS 2024

ISBN

979-8-3503-7334-9

ISSN

2473-2001

e-ISSN

—

Počet stran výsledku

6

Strana od-do

"nestrankovano"

Název nakladatele

IEEE

Místo vydání

New York

Místo konání akce

Himeji

Datum konání akce

9. 11. 2024

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—