Generalized decomposition of incomplete finite automata

Lower Bounds for Generalized Quantum Finite Automata

We obtain several lower bounds on the language recognition power of Nayak’s [12] generalized quantum finite automata (GQFA). Techniques for proving lower bounds on Kondacs and Watrous’ one-way quantum finite automata (KWQFA) were introduced by Ambainis and Freivalds [2], and were expanded in a series of papers. We show that many of these techniques can be adapted to prove lower bounds for GQFAs...

Generalized Weighted Finite Automata Based Image Compression

Finite Automata with Generalized Acceptance Criteria

We examine the power of nondeterministic finite automata with acceptance of an input word defined by a leaf language, i. e., a condition on the sequence of leaves in the automaton’s computation tree. We study leaf languages either taken from one of the classes of the Chomsky hierarchy, or taken from a timeor space-bounded complexity class. We contrast the obtained results with those known for l...

Algebraic hierarchical decomposition of finite state automata : a computational approach

The theory of algebraic hierarchical decomposition of finite state automata is an important and well developed branch of theoretical computer science (Krohn-Rhodes Theory). Beyond this it gives a general model for some important aspects of our cognitive capabilities and also provides possible means for constructing artificial cognitive systems: a Krohn-Rhodes decomposition may serve as a formal...

The correctness of a generalized disambiguation algorithm for finite automata

We present a generalized disambiguation algorithm of finite state automata, and show a proof of its correctness. This algorithm can remove ambiguities of finite state and tree automata. Our proposed algorithm can make finite state and tree automata more efficient to use in many applications.