On the Power of Subroutines for Finite State Machines
Nebel M (2001)
Journal of Automata, Languages and Combinatorics 6(1): 51--74.
Zeitschriftenaufsatz | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Einrichtung
Erscheinungsjahr
2001
Zeitschriftentitel
Journal of Automata, Languages and Combinatorics
Band
6
Ausgabe
1
Seite(n)
51--74
Page URI
https://pub.uni-bielefeld.de/record/2910042
Zitieren
Nebel M. On the Power of Subroutines for Finite State Machines. Journal of Automata, Languages and Combinatorics. 2001;6(1):51--74.
Nebel, M. (2001). On the Power of Subroutines for Finite State Machines. Journal of Automata, Languages and Combinatorics, 6(1), 51--74.
Nebel, Markus. 2001. “On the Power of Subroutines for Finite State Machines”. Journal of Automata, Languages and Combinatorics 6 (1): 51--74.
Nebel, M. (2001). On the Power of Subroutines for Finite State Machines. Journal of Automata, Languages and Combinatorics 6, 51--74.
Nebel, M., 2001. On the Power of Subroutines for Finite State Machines. Journal of Automata, Languages and Combinatorics, 6(1), p 51--74.
M. Nebel, “On the Power of Subroutines for Finite State Machines”, Journal of Automata, Languages and Combinatorics, vol. 6, 2001, pp. 51--74.
Nebel, M.: On the Power of Subroutines for Finite State Machines. Journal of Automata, Languages and Combinatorics. 6, 51--74 (2001).
Nebel, Markus. “On the Power of Subroutines for Finite State Machines”. Journal of Automata, Languages and Combinatorics 6.1 (2001): 51--74.
Google Scholar