Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 13037)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: DCFS 2021.
Buy print copy
About this book
The 16 full papers presented in this volume were carefully reviewed and selected from 21 submissions. The conference focus to all aspects of descriptional complexity-the costs of description of objects in various computational models such as Turing machines, pushdown automata, finite automata or grammars.
Similar content being viewed by others
Keywords
- automata
- automata theory
- automation
- computational linguistics
- computer science
- computer systems
- context free languages
- databases
- engineering
- finite automata
- finite state automata
- formal languages
- linguistics
- mathematics
- probability
- query languages
- regular languages
- state complexity
- theoretical computer science
- translation (languages)
Table of contents (16 papers)
Other volumes
-
Descriptional Complexity of Formal Systems
Editors and Affiliations
Bibliographic Information
Book Title: Descriptional Complexity of Formal Systems
Book Subtitle: 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings
Editors: Yo-Sub Han, Sang-Ki Ko
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-93489-7
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: IFIP International Federation for Information Processing 2021
Softcover ISBN: 978-3-030-93488-0Published: 25 December 2021
eBook ISBN: 978-3-030-93489-7Published: 01 January 2022
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 201
Number of Illustrations: 25 b/w illustrations, 5 illustrations in colour
Topics: Logics and Meanings of Programs