In this paper we combine determinization and state reduction methods into two-in-one algorithms that simultaneously perform determinization and state reduction. These algorithms perform better than all previous determinization algorithms for fuzzy finite automata, developed by Bělohlávek [Inform Sciences 143 (2002) 205–209], Li and Pedrycz [Fuzzy Set Syst 156 (2005) 68–92], Ignjatović et al. [I...

Fuzzy cellular automata (FCA) are cellular automata where the local rule is defined as the “fuzzification" of the local rule of the corresponding Boolean cellular automaton in disjunctive normal form. In this paper we are interested in two separate issues: the relationship between Boolean and fuzzy models, and the asymptotic behavior of elementary fuzzy cellular automata. On the first issue, we...

New types of systems of fuzzy relation inequalities and equations, called weakly linear, have been recently introduced in [J. Ignjatović, M. Ćirić, S. Bogdanović, On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, Fuzzy Sets and Systems 161 (2010) 3081–3113.]. The mentioned paper dealt with homogeneous weakly linear systems, composed of fuzzy relati...

We show that the methodology for testing the existence and computation the greatest simulations and bisimulations, developed in the framework of fuzzy automata [M. Ćirić et al., Fuzzy Sets and Systems 186 (2012) 100–139, 208 (2012) 22–42], can be applied in a similar form to weighted automata over an additively idempotent semiring. We define two types of simulations and four types of bisimulati...

We say that a word w on a totally ordered alphabet avoids the word v if there are no subsequences in w order-equivalent to v. In this paper we suggest a new approach to the enumeration of words on at most k letters avoiding a given pattern. By studying an automaton which for fixed k generates the words avoiding a given pattern we derive several previously known results for these kind of problem...

In this paper, a vocabulary trim down algorithm is proposed in decision tree-based acoustic model to make the model more close to the given task. Using this trim down model as seed model to do task adaptation is also presented. Based on this framework, users can configure the acoustic model by themselves according to their resources (such as vocabulary knowledge, a little amount task specific d...

The main result of this paper is that a pushdown automaton M augmented with R(n) reversal-bounded counters can be simulated by a Turing machine in time polynomial in n”’ + R(n) if M is 2-way, and in time polynomial in n + R(n) if M is l-way. It follows from this and previous results that for sufficiently large R(n), the addition of a pushdown store to R(n) reversal-bounded multicounter machines...

compensatory genetic fuzzy neural networks and their applications neural networks fuzzy logic and genetic algorithms by rajasekaran and g a v pai ebook free download nonlinear workbook chaos fractals cellular automata neural networks genetic algorithms gene expression programming wavelets fuzzy logic with c java and symbolicc programs applications of neural networks in environment energy and he...

This article deals with the recognition of recurring multivariate time series patterns modelled sample-point-wise by parametric fuzzy sets. An efficient classification-based approach for the online recognition of incompleted developing patterns in streaming time series is being presented. Furthermore, means are introduced to enable users of the recognition system to restrict results to certain ...