Keyword

descriptional complexity

Description: Descriptional complexity is the study of the size and expressive efficiency of formal descriptions, such as automata, grammars, and language representations.
OpenAlex ID: keywords/descriptional-complexity
2001 · Yu, Sheng · Journal of automata, languages and combinatorics · 196
2010 · Markus Holzer, Martin Kutrib · Information and Computation · 185
2003 · MARKUS HOLZER, MARTIN KUTRIB · International Journal of Foundations of Computer Science · 157
2000 · Jose Hernandez-Orallo · Journal of Logic Language and Information · 132
2002 · Jonathan Goldstine, Martin Kappes, et al. · JUCS - Journal of Universal Computer Science · 116
1996 · A Richard Green, Guy M Goodwin · BMJ · 83
2010 · Markus Holzer, Martin Kutrib · Mathematics, computing, language, and life · 77
2005 · HING LEUNG · International Journal of Foundations of Computer Science · 76
1983 · Péter Gács · Theoretical Computer Science · 72
2009 · Henning Bordihn, Markus Holzer, et al. · Theoretical Computer Science · 71
1973 · Jozef Gruska · Mathematical Foundations of Computer Science · 69
2009 · MARKUS HOLZER, MARTIN KUTRIB · International Journal of Foundations of Computer Science · 66
2007 · Galina Jirásková, Alexander Okhotin · RAIRO - Theoretical Informatics and Applications · 65
2010 · Markus Holzer, Martin Kutrib, et al. · Theoretical Computer Science · 62
1996 · Jeffrey Shallit, Yuri Breitbart · Journal of Computer and System Sciences · 60
2021 · Gacs, Peter · arXiv (Cornell University) · 51
2002 · Giovanni Pighizzini, Jeffrey Shallit, et al. · Journal of Computer and System Sciences · 49
2005 · MARTIN KUTRIB · International Journal of Foundations of Computer Science · 48
2002 · Jürgen Dassow, Victor Mitrana, et al. · Theoretical Computer Science · 46
2015 · Helmut Jürgensen, Juhani Karhumäki, et al. · Theoretical Computer Science · 45
2002 · Malcher, Andreas · Publication Server of Goethe University Frankfurt am Main (Goethe University Frankfurt) · 45
2000 · Gruska, Jozef · Journal of automata, languages and combinatorics · 44
2002 · Hromkovič, Juraj · Universitätsbibliothek Gießen · 42
2009 · Pierluigi Frisco · Oxford University Press eBooks · 41
2005 · Artiom Alhazov, Rudolf Freund, et al. · Lecture notes in computer science · 41
Works count: 588
Citation count: 5,152
Year
Topic
Type