On the Average Complexity of the Membership Problem for a Generalized Dyck Language
Nebel M (1997)
In: Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg: 352--363.
Konferenzbeitrag | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Einrichtung
Erscheinungsjahr
1997
Titel des Konferenzbandes
Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings
Seite(n)
352--363
ISBN
9783540633860
ISSN
0302-9743
Page URI
https://pub.uni-bielefeld.de/record/2910046
Zitieren
Nebel M. On the Average Complexity of the Membership Problem for a Generalized Dyck Language. In: Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg; 1997: 352--363.
Nebel, M. (1997). On the Average Complexity of the Membership Problem for a Generalized Dyck Language. Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings, 352--363. Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/BFb0036197
Nebel, Markus. 1997. “On the Average Complexity of the Membership Problem for a Generalized Dyck Language”. In Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings, 352--363. Berlin, Heidelberg: Springer Berlin Heidelberg.
Nebel, M. (1997). “On the Average Complexity of the Membership Problem for a Generalized Dyck Language” in Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings (Berlin, Heidelberg: Springer Berlin Heidelberg), 352--363.
Nebel, M., 1997. On the Average Complexity of the Membership Problem for a Generalized Dyck Language. In Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 352--363.
M. Nebel, “On the Average Complexity of the Membership Problem for a Generalized Dyck Language”, Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp.352--363.
Nebel, M.: On the Average Complexity of the Membership Problem for a Generalized Dyck Language. Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings. p. 352--363. Springer Berlin Heidelberg, Berlin, Heidelberg (1997).
Nebel, Markus. “On the Average Complexity of the Membership Problem for a Generalized Dyck Language”. Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. 352--363.
Google Scholar
ISBN Suche