Pushdown automata may contain transitions that are never used in any accepting run of the automaton. We present an algorithm for detecting such useless transitions. A finite automaton that captures the possible stack content during runs of the pushdown automaton, is first constructed in a forward procedure to determine which transitions are reachable, and then employed in a backward procedure t...

The state complexity of a finite(-state) automaton intuitively measures the size description automaton. Sakoda and Sipser [STOC 1972, pp. 275–286] were concerned with nonuniform families finite automata they discussed behaviors classes defined by such having polynomial-size complexity. In similar fashion, we introduce using quantum empowered flexible use garbage tapes. We first present general ...

This paper shows a design method for a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert a regular expression into a non-deterministic finite automaton (NFA). Then, to reduce the number of states, we convert the NFA into a merged-states non-deterministic finite automaton with unbounded string transition (MN...

In this paper a new nonlinear guidance law with finite time convergence is proposed. The second order integrated guidance and control loop is formulated considering a first order control loop dynamics. By transforming the state equations to the normal form, a finite time stabilizer feedback linearization technique is proposed to guarantee the finite time convergence of the system states to zero...

We study the relationship between the sizes of two-way finite automata accepting a language and its complement. In the deterministic case, for a given automaton (2dfa) with n states, we build an automaton accepting the complement with at most 4n states, independently of the size of the input alphabet. Actually, we show a stronger result, by presenting an equivalent 4n-state 2dfa that always hal...

There are several well known algorithms to minimize deterministic finite automata. In this paper, an algorithm is given for minimizing the number of states in a finite automaton or for determining if two finite automata are equivalent. The asymptotic running time of the algorithm is bounded by kn logn where k is some constant depends linearly on the size of the input alphabet and n is the numbe...

A simple algorithm for checking language equivalence of finite automata consists in trying to compute a bisimulation that relates them. This is possible because language equivalence can be characterised coinductively, as the largest bisimulation. More precisely, consider an automaton 〈S, t, o〉, where S is a (finite) set of states, t : S → P(S) is a non-deterministic transition function, and o :...

The problem of inducing automata of minimal size consistent with finite sets of examples and counter-examples is the combinatorial optimization task of grammatical inference and is known to be computationally hard. Both an exact and a heuristic method of finding a non-deterministic finite automaton (NFA) with a given number of states such that all examples are accepted and all counter-examples ...

We show that the neighbourhood of a regular language L with respect to an additive quasi-distance can be recognized by an additive weighted finite automaton (WFA). The size of the WFA is the same as the size of an NFA (nondeterministic finite automaton) for L and the construction gives an upper bound for the state complexity of a neighbourhood of a regular language with respect to a quasi-dista...

The study of descriptional complexity issues for finite automata dates back to the mid 1950’s. One of the earliest results is that deterministic and nondeterministic finite automata are computationally equivalent, and that nondeterministic finite automata can offer exponential state savings compared to deterministic ones, see [11]—by the powerset construction one increases the number of states ...