Titlebook: Implementation and Application of Automata; 11th International C Oscar H. Ibarra,Hsu-Chun Yen Conference proceedings 2006 Springer-Verlag B

sed-rate

bile648

On the Computation of Some Standard Distances Between Probabilistic Automatants an exhaustive analysis of the problem of computing the .. distance between two automata. We give efficient exact and approximate algorithms for computing these distances for . even and prove the problem to be NP-hard for all odd values of ., thereby completing previously known hardness results.

Vldl379

Does o-Substitution Preserve Recognizability?s seem to be an interesting transformation device in syntactic pattern matching. In this contribution, it is shown that o-substitution preserves recognizable tree series provided that the target tree series is linear and the semiring is idempotent, commutative, and continuous. This result is applied

減至最低

用樹皮

Bisimulation Minimization of Tree Automatae non-deterministic tree automata (NTA) with respect to bisimulation. We show that our algorithm has an overall complexity of ., where . is the maximum rank of the input alphabet, . is the total size of the transition table, and . is the number of states.

展覽

弓箭

Structurally Unambiguous Finite Automataall input strings . and for any state ., there is at most one path from .. to . that consumes .. The definition of SUFA differs from the usual definition of an unambiguous finite automaton (UFA) in that the new definition is defined in terms of the transition logic of the finite automaton, and is in

終點

四海為家的人

Constrain