Geodesic
Finite Automata with Generalized Acceptance Criteria
Discrete mathematics & theoretical computer science, Tome 4 (2000-2001) no. 2.

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2001_4_2_a14,
     author = {Peichl, Timo and Vollmer, Heribert},
     title = {Finite {Automata} with {Generalized} {Acceptance} {Criteria}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {4},
     number = {2},
     year = {2000-2001},
     doi = {10.46298/dmtcs.287},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.287/}
}
TY  - JOUR
AU  - Peichl, Timo
AU  - Vollmer, Heribert
TI  - Finite Automata with Generalized Acceptance Criteria
JO  - Discrete mathematics & theoretical computer science
PY  - 2000-2001
VL  - 4
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.287/
DO  - 10.46298/dmtcs.287
LA  - en
ID  - DMTCS_2001_4_2_a14
ER  - 
%0 Journal Article
%A Peichl, Timo
%A Vollmer, Heribert
%T Finite Automata with Generalized Acceptance Criteria
%J Discrete mathematics & theoretical computer science
%D 2000-2001
%V 4
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.287/
%R 10.46298/dmtcs.287
%G en
%F DMTCS_2001_4_2_a14
Peichl, Timo; Vollmer, Heribert. Finite Automata with Generalized Acceptance Criteria. Discrete mathematics & theoretical computer science, Tome 4 (2000-2001) no. 2. doi : 10.46298/dmtcs.287. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.287/

Cité par Sources :