Add to ORKGAbstract. The problem of determining whether several finite automata accept a common word is closely related to the well-studied membership problem in transformation monoids. We review the complexity of the intersection problem and raise the issue of limiting the number of final states in the automata involved. In particular, we consider commutative automata with at most two final states and we partially elucidate the complexity of their intersection nonemptiness and related problems.
AbstractWe present binary deterministic finite automata of n states that meet the upper bound 2n on ...
The question of whether there is an automaton with n states which agrees with a finite set D of data...
We identify several simple but powerful concepts, techniques, and results; and we use them to charac...
Abstract. The problem of determining whether several finite automata accept a word in common is clos...
Abstract. The problem of determining whether several finite automata accept a word in common is clos...
AbstractA finite automaton with state space S and alphabet A can be thought of as a directed graph w...
We investigate the intersection problem for finite monoids, which asks for a given set of regular la...
We study the complexity of basic regular operations on languages represented by incomplete deter-min...
AbstractThe goal of this paper is to study the exact complexity of several important problems concer...
When their reading heads are allowed to move completely asynchronously, finite-state automata with m...
In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m o...
This report focuses on the following basic decision problems of finite tree automata: nonemptiness ...
AbstractWe investigate the average-case state and transition complexity of deterministic and nondete...
Merging states in finite automata is a main method of reducing the size of the represen-tation of re...
AbstractWe investigate the relationship between regular languages and syntactic monoid size. In part...
AbstractWe present binary deterministic finite automata of n states that meet the upper bound 2n on ...
The question of whether there is an automaton with n states which agrees with a finite set D of data...
We identify several simple but powerful concepts, techniques, and results; and we use them to charac...
Abstract. The problem of determining whether several finite automata accept a word in common is clos...
Abstract. The problem of determining whether several finite automata accept a word in common is clos...
AbstractA finite automaton with state space S and alphabet A can be thought of as a directed graph w...
We investigate the intersection problem for finite monoids, which asks for a given set of regular la...
We study the complexity of basic regular operations on languages represented by incomplete deter-min...
AbstractThe goal of this paper is to study the exact complexity of several important problems concer...
When their reading heads are allowed to move completely asynchronously, finite-state automata with m...
In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m o...
This report focuses on the following basic decision problems of finite tree automata: nonemptiness ...
AbstractWe investigate the average-case state and transition complexity of deterministic and nondete...
Merging states in finite automata is a main method of reducing the size of the represen-tation of re...
AbstractWe investigate the relationship between regular languages and syntactic monoid size. In part...
AbstractWe present binary deterministic finite automata of n states that meet the upper bound 2n on ...
The question of whether there is an automaton with n states which agrees with a finite set D of data...
We identify several simple but powerful concepts, techniques, and results; and we use them to charac...