Jumping Fuzzy General Finite Automata and Their Simplified Description
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F19%3A63523839" target="_blank" >RIV/70883521:28140/19:63523839 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.3233/FAIA190235" target="_blank" >http://dx.doi.org/10.3233/FAIA190235</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3233/FAIA190235" target="_blank" >10.3233/FAIA190235</a>
Alternative languages
Result language
angličtina
Original language name
Jumping Fuzzy General Finite Automata and Their Simplified Description
Original language description
The paper deals with a simplified form of jumping fuzzy general finite automata where transition function is bivalent and only the final states form a fuzzy set. It is proved that despite the simplification, the computational power of the automata is not reduced.
Czech name
—
Czech description
—
Classification
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)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Frontiers in Artificial Intelligence and Applications
ISBN
978-1-64368-018-7
ISSN
09226389
e-ISSN
—
Number of pages
6
Pages from-to
667-672
Publisher name
IOS Press
Place of publication
Amsterdam
Event location
Kitakyushu City
Event date
Oct 18, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—