In good for games (GFG) automata, it is possible to resolve nondeterminism in a way that only depends on the past and still accepts all the words in the language. The motivation for GFG automata comes from their adequacy for games and synthesis, wherein general nondeterminism is inappropriate. We continue the ongoing effort of studying the power of nondeterminism in GFG automata. Initial indica...

Computing short regular expressions equivalent to a given finite automaton is a hard task. In this work we present a class of acyclic automata for which it is easy to find a regular expression that has linear size. We call those automata UDR. A UDR automaton is characterized by properties of its underlying digraph. We present a characterisation theorem and an efficient algorithm to determine if...

Modeling the morphological structure of natural languages in terms of a nondeterministic finite-state automaton is shown to be inadequate in its handling of some common natural language phenomena. We show that a two-tape nondeterministic automaton is capable of handling these phenomena. The modeling is improved by the specification of a new type of automaton, the preset two-head automaton, whic...

In this paper we deal with 1-way multihead finite automata, in which the symbol under only one head (called read head) controls its move and other heads cannot distinguish the input symbols, they can only distinguish the end-marker from the other input symbols and they are called the blind head. We call such automaton a partially blind multihead automaton. We prove that partially blind k + 1-he...

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...

Given a non-deterministic timed automaton with silent transitions (eNTA), we show that after an initial stage it becomes timeperiodic. After computing the periodic parameters, we construct a finite almost periodic augmented region automaton, which includes a clock measuring the global time. In the next step we construct the timestamp of the automaton: the union of all its observable timed trace...

We consider a deterministic finite automaton which accepts all subsequences of a set of texts, called subsequence automaton. We show an online algorithm for constructing subsequence automaton for a set of texts. It runs in O(|Σ|(m+ k) +N) time using O(|Σ|m) space, where |Σ| is the size of alphabet, m is the size of the resulting subsequence automaton, k is the number of texts, and N is the tota...

To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from combinatorial game played on the language of $X$. Previously it has been studied what properties $X$ does inherit. For example, and have same factor complexity if is sofic subshift, then also sofic. In this paper, develop notion automaticity for $W(X)$, that is, propose means vector representation ac...

This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution property (SP) partition for a finite intuitionistic fuzzy automaton is formulated, and the quotient automaton with respect to an SP partition is defined.