Finite Automata with Generalized Acceptance Criteria - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2001

Finite Automata with Generalized Acceptance Criteria

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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
87 View
1160 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More