Ivana Micić

Prof. Ivana Micić


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 November 2020 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
SSStefan Stanimirovic
Stefan Stanimirovic
IMIvana Micić
Ivana Micić
MĆMiroslav Ćirić
Miroslav Ćirić
In this paper, we define λ-approximate simulations and bisimulations for fuzzy automata over complete Heyting algebras. The value λ presents the degree of language similarity or equality between observed fuzzy automata. Algorithms for computing the greatest λ-approximate simulations and bisimulations are given. We show that λ-approximate simulations and bisimulations on a fuzzy automaton can be effectively used for factorization of fuzzy automata. We present the algorithm that splits the interval of the degrees of language similarity or equality into subintervals with same minimal corresponding factor fuzzy automata.

1 May 2018 in Fuzzy Sets and Systems
Verified
Journal Article
Closed access
IMIvana Micić
Ivana Micić
ZJZorana Jančić
Zorana Jančić
SSStefan Stanimirović
Stefan Stanimirović

16 February 2015 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Open access
IMIvana Micić
Ivana Micić
ZJZorana Jancic
Zorana Jancic
JIJelena Ignjatovic
Jelena Ignjatovic
MĆMiroslav Ćirić
Miroslav Ćirić
Determinization of fuzzy finite automata is understood here as a procedure of their conversion into equivalent crisp-deterministic fuzzy automata, which can be viewed as being deterministic with possible infinitely many states, but with fuzzy sets of terminal states. Particularly, significant determinization methods are those that provide a minimal crisp-deterministic fuzzy automaton equivalent to the original fuzzy finite automaton called canonization methods. One canonization method for fuzzy finite automata, the Brzozowski type determinization, has been developed recently by Jancic and Ciric in [10]. Here we provide another canonization method for a fuzzy finite automaton A = (A, σ, δ, r) over a complete residuated lattice £, based on the degrees of inclusion of the right fuzzy languages associated with states of A into the left derivatives of the fuzzy language recognized by A. The proposed procedure terminates in a finite number of steps, whenever the membership values taken by δ, σ, and r generate a finite subsemiring of the semiring reduct of £. This procedure is generally faster than the Brzozowski type determinization, and if the basic operations in the residuated lattice £ can be performed in constant time, it has the same computational time as all other determinization procedures provided in [8], [11], and [12].

2 June 2022 in Information Sciences
Verified
Journal Article
Closed access
SSStefan Stanimirović
Stefan Stanimirović
IMIvana Micić
Ivana Micić

2 March 2024 in Discrete Event Dynamic Systems
Verified
Journal Article
Closed access
PDF file
MĆMiroslav Ćirić
Miroslav Ćirić
IMIvana Micić
Ivana Micić
JMJelena Matejić
Jelena Matejić
ASAleksandar Stamenković
Aleksandar Stamenković

12 May 2022 in Fuzzy Sets and Systems
Verified
Journal Article
Closed access
IMIvana Micić
Ivana Micić
SSStefan Stanimirović
Stefan Stanimirović
ZJZorana Jančić
Zorana Jančić