Emptiness check is a key operation in the automata-theoretic approach to LTL verification. However, it is usually done on Büchi automata with a single acceptance condition. We review existing on-the-fly emptiness-check algorithms for generalized Büchi automata (i.e., with multiple acceptance conditions) and show how they compete favorably with emptiness-checks for degeneralized automata, especi...

A class of fermionic quantum field theories with interactions is shown to be equivalent probabilistic cellular automata, namely automata a probability distribution for the initial states. Probabilistic on one-dimensional lattice are two-dimensional fermions. They can viewed as generalized Ising models square and therefore classical statistical systems. As they Thus mechanics emerges from statis...

Abstract Automata learning is a technique to infer an automaton model of black-box system via queries the system. In recent years it has found widespread use both in industry and academia, as enables formal verification when no available or too complex create one manually. this paper we consider problem individual components synchronous system, assuming can only query whole We introduce composi...

We introduce and investigate input-driven stack automata, which are a generalization of input-driven pushdown automata that recently became popular under the name visibly pushdown automata. Basically, the idea is that the input letters uniquely determine the operations on the pushdown store. This can nicely be generalized to stack automata by further types of input letters which are responsible...

We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected k × k matrix. Only one entry of the vector can be tested for equality to 1 at any time. Classes of languages recognized by deterministic, nondeterministic, and “blind” versions of these machines are ...

—Due to its importance as a model for several software and hardware applications, automata theory is a core topic in computer science and engineering education. But because of its abstract mathematical nature automata is used to be taught by traditional lecture-driven style. Virtual reality and web-based learning can provide automata learners with a unique experience such as interactive learnin...