Approximate minimization of fuzzy automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F07%3A00004947" target="_blank" >RIV/61989592:15310/07:00004947 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Approximate minimization of fuzzy automata
Original language description
The paper presents a contribution to minimization of fuzzy automata. Traditionally, the problem of minimization of fuzzy automata results directly from the problem of minimization of ordinary automata. That is, given a fuzzy automaton, describe an automaton with the minimal number of states which recognizes the same language as the given one. In this paper, we formulate a different problem. Namely, the minimal fuzzy automaton we are looking for is required to recognize a language which is similar to thelanguage of the given fuzzy automaton to a certain degree a, such as a = 0.9, prescribed by a user. That is, we relax the condition of being equal to a weaker condition of being similar to degree a.
Czech name
Přibližná minimalizace fuzzy automatů
Czech description
Práce pojednává o přibližné minimalizaci fuzzy automatů.
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
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
Proceedings of the 10th Joint Conference on Information Sciences
ISBN
978-981-270-967-7
ISSN
—
e-ISSN
—
Number of pages
1
Pages from-to
7
Publisher name
World Scientific Publishing Company
Place of publication
Singapore
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—