Finite Automata with Generalized Acceptance Criteria - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2001

Finite Automata with Generalized Acceptance Criteria

Résumé

We examine the power of nondeterministic finite automata with acceptance of an input word defined by a 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.
Fichier principal
Vignette du fichier
dm040210.pdf (104.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00958956 , version 1 (13-03-2014)

Identifiants

Citer

Timo Peichl, Heribert Vollmer. Finite Automata with Generalized Acceptance Criteria. Discrete Mathematics and Theoretical Computer Science, 2001, Vol. 4 no. 2 (2), pp.179-192. ⟨10.46298/dmtcs.287⟩. ⟨hal-00958956⟩

Collections

TDS-MACS
89 Consultations
1243 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More