Approximate String Matching by Fuzzy Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F09%3A00010267" target="_blank" >RIV/61989592:15310/09:00010267 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Approximate String Matching by Fuzzy Automata
Original language description
We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the others. This kind of similarity can't be handled by usual searching algorithms.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
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
Znalosti 2009, sborník příspěvků
ISBN
978-80-227-3015-0
ISSN
—
e-ISSN
—
Number of pages
394
Pages from-to
—
Publisher name
Vydavateľstvo Slovenskej technickej univerzity
Place of publication
Bratislava
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—