Finite Automata with Generalized Acceptance Criteria

Authors:
Timo Peichl;Heribert Vollmer
Affiliations:
-;-
Venue:
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Year:
1999

Citing 10
Cited 1

On uniformity within NC1

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
A uniform approach to define complexity classes

Theoretical Computer Science
Introduction to the theory of complexity

Introduction to the theory of complexity
On input read-modes of alternating Turing machines

Theoretical Computer Science
Logspace and logtime leaf languages

Information and Computation
Regular languages

Handbook of formal languages, vol. 1
Gap-languages and log-time complexity classes

Theoretical Computer Science
Nondeterministic NC1 computation

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Alternation

Journal of the ACM (JACM)
Locally Definable Acceptance Types for Polynomial Time Machines

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science

A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the power of nondeterministic finite automata with acceptance of an input word defined by a so called leaf language, i. e., a condition on the sequence of leaves in the automaton's computation tree. We study leaf languages either taken from one of the classes of the Chomsky hierarchy, or taken from a time- or space-bounded complexity class. We contrast the obtained results with those known for leaf languages for Turing machines and Boolean circuits.