Austinat, Diekert, Hertrampf, and Petersen [2] proved that every language L that is (m, n)-recognizable by a deterministic frequency automaton such that m > n/2 can be recognized by a deterministic finite automaton as well. First, the size of deterministic frequency automata and of deterministic finite automata recognizing the same language is compared. Then approximations of a language are con...

In [18] the last three authors introduced the notion of a generalized directable automaton as a generalization of many already known types of automata. The algorithms for testing whether a finite automaton belongs to some of important subclasses of the class of generalized directable automata are studied by the authors in [20]. In this paper structural properties of finite and infinite generali...

Okhotin [9] showed an exponential trade-off in the conversion from nondeterministic unary finite automata to unambiguous nondeterministic unary finite automata. In this paper, we consider the trade-off in the case of unary symmetric difference finite automata to finitely ambiguous unary symmetric difference finite automata. Surprisingly, the trade-off is linear in the number of states of the fi...

Abstract We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A automaton a weighted over semiring. called if number of accepting runs on every bounded by global constant. The asks whether given automaton, there exist many deterministic automata whose pointwise maximum equivalent to automaton.

On equivalence and emptiness problems of multi-letter (measure many) quantum finite automata Abstract In this paper, we study some decision problems both for multi-letter quantum finite au-tomata and measure many multi-letter quantum finite automata. We first show that given a k1-letter quantum finite automaton A1 and a k2-letter quantum finite automaton A2 over the same input alphabet Σ, they ...

Left-discrimination of a semigroup is defined and shown to be a sufficient condition that a semigroup be isomorphic to the input semigroup of its semigroup automaton, a necessary condition if the semigroup is finite. The left-discrimination sequence of an automaton is defined as a sequence of semigroups beginning with the input semigroup of the automaton, each member being the input semigroup o...

Abstract We present algorithms for model checking and controller synthesis of timed automata, seeing a automaton as parallel composition large finite-state machine relatively smaller automaton, using compositional reasoning on this composition. use automata learning to learn finite approximations the component, in order reduce problem at hand or synthesis. an experimental evaluation our approach.

It is inevitable for networks to be invaded during operation. The intrusion tolerance technology comes into being enable provide the necessary network services. This paper introduces an automatic learning mechanism of system update security strategy, and derives finite automaton model from existing model. proposed was quantified by Markov theory compute stable probability each state. calculated...