in this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $nondeterministic$ $fuzzy$$finite$ $tree$ $automata$ (nffta). initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). inorder to eliminate these limitations and increasing theefficiency of ffta, we defin...

Finite automata have been recently used as alternative, discrete models in theoretical physics, especially in problems related to the dichotomy between endophysical/intrinsic and exophysical/extrinsic perception (see, for instance [15, 18, 16, 7, 17, 4]). These studies deal with Moore experiments; the main result states that it is impossible to determine the initial state of an automaton, and, ...

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 describe a minimization procedure for nondeterministic Büchi automata (NBA). For an automaton A another automaton Amin with the minimal number of states is learned with the help of a SATsolver. This is done by successively computing automata A′ that approximate A in the sense that they accept a given finite set of positive examples and reject a given finite set of negative examples. In the c...

This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) from a list of input and output strings. The algorithm generalizes a known method of constructing minimal finite-state automata (Daciuk, Mihov, Watson and Watson 2000). Unlike the algorithm published by Mihov and Maurel (2001), it does not require the input strings to be s...

This article explores the computational power of bi-dimensional cellular automata acting on periodical configurations. It extends in some sense the results of a similar paper dedicated to the one-dimensional case. More precisely, we present an algorithm that computes a “minimal pattern network”, i.e. a minimal pattern and the two translation vectors it can use to tile the entire configuration. ...

We develop a generic technique to compute minimal separating DFAs (deterministic finite automata) and regular invariants. Our technique works by expressing the desired properties of a solution in terms of logical formulae and using SAT or SMT solvers to find solutions. We apply our technique to three concrete problems: computing minimal separating DFAs (e.g., used in compositional verification)...

The synchronization problem for a deterministic n-state automaton consists in the search of an input-sequence, called a synchronizing word such that the state attained by the automaton, when this sequence is read, does not depend on the initial state of the automaton itself. If such a sequence exists, the automaton is called synchronizing. If the automaton is deterministic and complete, a well-...

This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) for a dictionary consisting of a list of input and output strings. The algorithm generalises a known method of constructing minimal finite-state automata (Daciuk et al., 2000). Unlike the algorithm published by Mihov and Maurel (2001), it does not require the input strings...