Journal article
Authors list: Dassow, Juergen; Kutrib, Martin; Pighizzini, Giovanni
Publication year: 2023
Pages: 133-167
Journal: Bulletin of the European Association for Theoretical Computer Science
Issue number: 141
ISSN: 0252-9742
Publisher: European Association for Theoretical Computer Science
Abstract:
Since the late nineties the scope of the International Conference of Descrip-tional Complexity of Formal Systems (DCFS) encompasses all aspects of de-scriptional complexity, both in theory and application. We first consider the historical development of the conference. Then we turn to some impressions from the 25 editions of the conference, which we particularly remember. In order to give a deeper inside in the field of descriptional complexity, we present some of its very basics from a general abstract perspective. Then we turn to some of the outstanding and dominating directions in the course of time. The results presented are not proved but we merely draw attention to the overall picture and some of the main ideas involved.
Citation Styles
Harvard Citation style: Dassow, J., Kutrib, M. and Pighizzini, G. (2023) 25 EDITIONS OF DCFS: ORIGINS AND DIRECTIONS, Bulletin of the European Association for Theoretical Computer Science(141), pp. 133-167
APA Citation style: Dassow, J., Kutrib, M., & Pighizzini, G. (2023). 25 EDITIONS OF DCFS: ORIGINS AND DIRECTIONS. Bulletin of the European Association for Theoretical Computer Science(141), 133-167.
Keywords
CELLULAR-AUTOMATA; DESCRIPTIONAL COMPLEXITY; FINITE AUTOMATA; FIXED NUMBER; MAGIC NUMBERS; OPERATIONS; QUOTIENT COMPLEXITY; REGULAR LANGUAGES; STATE COMPLEXITIES; SUCCINCT REPRESENTATION