# Discrete Mathematics & Theoretical Computer Science

## Volume 4 n° 2 (2001), pp. 179-192

author: | Timo Peichl and Heribert Vollmer |
---|---|

title: | Finite Automata with Generalized Acceptance Criteria |

keywords: | finite automata, generalized acceptance criteria, leaf language, formal languages, complexity classes |

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. |

reference: | Timo Peichl and Heribert Vollmer (2001),
Finite Automata with Generalized Acceptance Criteria,
Discrete Mathematics and Theoretical Computer Science 4, pp. 179-192 |

bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |

ps.gz-source: | dm040210.ps.gz (49 K) |

ps-source: | dm040210.ps (133 K) |

pdf-source: | dm040210.pdf (136 K) |

The first *source* gives you the `gzipped' PostScript, the second the plain
PostScript and the third the format for the Adobe accrobat
reader. Depending on the installation of your web browser, at least
one of these should (after some amount of time) pop up a window for
you that shows the full article. If this is not the case, you should
contact your system administrator to install your browser correctly.

Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.

Automatically produced on Tue Oct 30 12:57:33 CET 2001 by gustedt