Finite automata with generalized acceptance criteria.

Peichl, Timo; Vollmer, Heribert

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2001)

  • Volume: 4, Issue: 2, page 179-192 p.
  • ISSN: 1365-8050

How to cite

top

Peichl, Timo, and Vollmer, Heribert. "Finite automata with generalized acceptance criteria.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 4.2 (2001): 179-192 p.. <http://eudml.org/doc/121679>.

@article{Peichl2001,
author = {Peichl, Timo, Vollmer, Heribert},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {leaf language; formal languages; complexity classes},
language = {eng},
number = {2},
pages = {179-192 p.},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Finite automata with generalized acceptance criteria.},
url = {http://eudml.org/doc/121679},
volume = {4},
year = {2001},
}

TY - JOUR
AU - Peichl, Timo
AU - Vollmer, Heribert
TI - Finite automata with generalized acceptance criteria.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2001
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 4
IS - 2
SP - 179
EP - 192 p.
LA - eng
KW - leaf language; formal languages; complexity classes
UR - http://eudml.org/doc/121679
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.