On the Power of Subroutines for Finite State Machines

Nebel M (2001)
Journal of Automata, Languages and Combinatorics 6(1): 51--74.

Download
No fulltext has been uploaded. References only!
Journal Article | English

No fulltext has been uploaded

Publishing Year
PUB-ID

Cite this

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, 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.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar