Residuality plays an essential role for learning finite automata. While residual deterministic and nondeterministic automata have been understood quite well, fundamental questions concerning alternating automata (AFA) remain open. Recently, Angluin, Eisenstat, and Fisman [3] have initiated a systematic study of residual AFAs and proposed an algorithm called AL – an extension of the popular L al...

We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string languages defining the transitions are represented by a DFA or an NFA. Also, we consider for unranked tree automata the alternative syntactic def...

There is a well known relationship between alternating automata on finite words and symbolically represented nondeterministic automata on finite words. This relationship is of practical relevance because it allows to combine the advantages of alternating and symbolically represented nondeterministic automata on finite words. However, for infinite words the situation is unclear. Therefore, this ...

Temporal logics like LTL are frequently used for the specification and verification of reactive systems. For verification, LTL formulas are typically translated to generalized nondeterministic Büchi automata so that the verification problem is reduced to checking the emptiness of automata. While this can be done symbolically for nondeterministic automata, other applications require deterministi...

in this note, by considering the notions of the intuitionistic general l-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{l}$, there exists a minimal intuitionistic general l-fuzzy automaton recognizing $mathcal{l}$.we prove that the minimal intuitionistic general l-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

A polynomial-time algorithm for the identification of interaction and memory structures in discrete valued, nondeterministic, cyclic social behavior data is developed. The output of the probabilistic search algorithm is the strategy update function for each individual automaton agent in given population. For our modeling purpose, we used automata networks model and added “block-extended memory”...

We investigate problems for regular languages coded by alternating nite automata. In automata and formal language theory, it is well-known that there is a language accepted by an n-state nondeterministic nite automaton but any deterministic nite automaton accepting that language must have at least 2 n states. Diierent representations of regular languages are used to deene problems of varying le...

The present paper gives a thorough characterization of classes of !-languages deened by several classes of recursive automata and elementary acceptance conditions in terms of the arithmetical hierarchy. Here it is interesting to note that nitely branching nondeterministic looping or CoB uchi-accepting automata are only as powerful as their de-terministic counterparts whereas nondeterministic B ...

We have developed YFilter, an XML filtering system that provides fast, on-the-fly matching of XMLencoded data to large numbers of query specifications containing constraints on both structure and content. YFilter encodes path expressions using a novel NFA-based approach that enables highly-efficient, shared processing for large numbers of XPath expressions. In this paper, we provide a brief tec...