Title
Poboljšani algoritmi za determinizaciju fazi i težinskih automata
Creator
Stanimirović, Stefan P. 1989-
Copyright date
2019
Object Links
Select license
Autorstvo-Nekomercijalno-Bez prerade 3.0 Srbija (CC BY-NC-ND 3.0)
License description
Dozvoljavate samo preuzimanje i distribuciju dela, ako/dok se pravilno naznačava ime autora, bez ikakvih promena dela i bez prava komercijalnog korišćenja dela. Ova licenca je najstroža CC licenca. Osnovni opis Licence: http://creativecommons.org/licenses/by-nc-nd/3.0/rs/deed.sr_LATN. Sadržaj ugovora u celini: http://creativecommons.org/licenses/by-nc-nd/3.0/rs/legalcode.sr-Latn
Language
Serbian
Cobiss-ID
Theses Type
Doktorska disertacija
description
Datum odbrane: 30.08.2019.
Other responsibilities
mentor
Ćirić, Miroslav 1964-
predsednik komisije
Ignjatović, Jelena 1973-
član komisije
Tepavčević, Andrea
član komisije
Stamenković, Aleksandar
član komisije
Jančić, Zorana
Academic Expertise
Prirodno-matematičke nauke
Academic Title
-
University
Univerzitet u Nišu
Faculty
Prirodno-matematički fakultet
Group
Odsek za matematiku i informatiku
Alternative title
Improved algorithms for determinization of fuzzy and weighted automata
Publisher
[S. P. Stanimirović]
Format
VII, 182 str.
description
Biografija autora: str. 181;
Bibliografija: str. 182;
Bibliografija uz svaki rad.
description
Theory of computing
Abstract (en)
Determinization algorithms are methods that calculate complete deterministic
fuzzy (weighted) automaton that is language equivalent to the input fuzzy
(weighted) automaton, and they have found application in numerous fields,
including lexicographic analysis, analysis of regular expressions, automatic
speech recognition, pattern recognition in artificial intelligence, etc.
Especially important class of determinization algorithms are canonization
algorithms, which produce minimal complete deterministic fuzzy (weighted)
automaton equivalent to the input fuzzy (weighted) automaton. The aim of
this dissertation is the development of determinization algorithms based on
the concept of factorizations, as well as computing and merging of the
indistinguishable states of fuzzy (weighted) automaton under construction. At
the same time, computing and merging of the indistinguishable states is done
by right and left invariant fuzzy relations in the case of fuzzy automata, as
well as by right and left invariant Boolean matrices in the case of weighted
automata. We apply the partition refinement technique to obtain improved
algorithms for computing the greatest right and left invariant Boolean
equivalence and quasi – order matrices. In the end, we consider ways to
compute the greatest right and left invariant fuzzy equivalences and fuzzy
quasi – orders when the algorithms for their computation, based on the
partition refinement technique, are unable to stop in a finite number of steps.
Authors Key words
Fazi automati, fazi jezici, determinizacija
Authors Key words
Fuzzy automata, fuzzy languages, determinization
Classification
519.713(043.3)
Subject
P110, P176
Type
Tekst
Abstract (en)
Determinization algorithms are methods that calculate complete deterministic
fuzzy (weighted) automaton that is language equivalent to the input fuzzy
(weighted) automaton, and they have found application in numerous fields,
including lexicographic analysis, analysis of regular expressions, automatic
speech recognition, pattern recognition in artificial intelligence, etc.
Especially important class of determinization algorithms are canonization
algorithms, which produce minimal complete deterministic fuzzy (weighted)
automaton equivalent to the input fuzzy (weighted) automaton. The aim of
this dissertation is the development of determinization algorithms based on
the concept of factorizations, as well as computing and merging of the
indistinguishable states of fuzzy (weighted) automaton under construction. At
the same time, computing and merging of the indistinguishable states is done
by right and left invariant fuzzy relations in the case of fuzzy automata, as
well as by right and left invariant Boolean matrices in the case of weighted
automata. We apply the partition refinement technique to obtain improved
algorithms for computing the greatest right and left invariant Boolean
equivalence and quasi – order matrices. In the end, we consider ways to
compute the greatest right and left invariant fuzzy equivalences and fuzzy
quasi – orders when the algorithms for their computation, based on the
partition refinement technique, are unable to stop in a finite number of steps.
“Data exchange” service offers individual users metadata transfer in several different formats. Citation formats are offered for transfers in texts as for the transfer into internet pages. Citation formats include permanent links that guarantee access to cited sources. For use are commonly structured metadata schemes : Dublin Core xml and ETUB-MS xml, local adaptation of international ETD-MS scheme intended for use in academic documents.