Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, March 13, 2014 - 4:53:03 PM
Last modification on : Friday, September 17, 2021 - 2:50:09 PM
Long-term archiving on: : Friday, June 13, 2014 - 12:04:34 PM


Files produced by the author(s)




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



Record views


Files downloads