On the descriptional complexity of finite automata with modified acceptance conditions

Authors:
Markus Holzer;Martin Kutrib
Affiliations:
Institut für Informatik, Technische Universität München, Boltzmannstraße 3, D-85748 Garching bei München, Germany;Institut für Informatik, Universität Gießen, Arndtstraße 2, D-35392 Gießen, Germany
Venue:
Theoretical Computer Science - Descriptional complexity of formal systems
Year:
2005

Citing 10
Cited 0

On &ohgr;-automata and temporal logic

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the state complexity of intersection of regular languages

ACM SIGACT News
Partial orders on words, minimal elements of regular languages, and state complexity

Theoretical Computer Science
The state complexities of some basic operations on regular languages

Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata

Information Processing Letters
Regular languages

Handbook of formal languages, vol. 1
State complexity of regular languages

Journal of Automata, Languages and Combinatorics
State Complexity of Basic Operations on Finite Languages

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Unary language operations and their nondeterministic state complexity

DLT'02 Proceedings of the 6th international conference on Developments in language theory
State complexity of basic operations on nondeterministic finite automata

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider deterministic and nondeterministic finite automata with acceptance conditions that rely on the whole history of a computation on a given word and not only on the last state of the computation under consideration. Formally, these conditions can be seen as the natural analogies of the Büchi and Muller acceptance for finite automata on infinite words. We study the computational power of these new acceptance mechanisms and prove some results on the descriptional complexity of conversions between automata with these new acceptance criteria and finite automata with ordinary acceptance.