Descriptional complexity of formal systems : 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25-27, 2018, Proceedings / edited by Stavros Konstantinidis, Giovanni Pighizzini (eds.).
Material type:
TextSeries: Lecture notes in computer science ; 10952. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publisher: Cham, Switzerland : Springer, 2018Description: 1 online resource (xiv, 251 pages) : illustrationsContent type: - text
- computer
- online resource
- 9783319946313
- 3319946315
- DCFS 2018
- Formal methods (Computer science) -- Congresses
- Formal languages -- Congresses
- Méthodes formelles (Informatique) -- Congrès
- Langages formels -- Congrès
- Natural language & machine translation
- Discrete mathematics
- Algorithms & data structures
- Computer programming -- software development
- Computers -- Speech & Audio Processing
- Computers -- Data Processing
- Computers -- Data Modeling & Design
- Computers -- Programming -- General
- Formal languages
- Formal methods (Computer science)
- 004.01/51 23
- QA76.9.F67 D34 2018eb
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
eBook
|
e-Library | eBook LNCS | Available |
Includes bibliographical references and author index.
Online resource; title from PDF title page (SpringerLink, viewed July 20, 2018).
Formal languages and automata theory -- State complexity -- Grammars -- Randomness -- Automata extensions -- Algebraic language theory.
This book constitutes the proceedings of the 20th International Conference on Descriptional Complexity of Formal Systems, DCFS 2018, held in Halifax, NS, Canada, in July 2018. The 19 full papers presented were carefully reviewed and selected from 24 submissions. DCFS is an annual international working conference concerning the descriptional complexity of formal systems and structures and its applications. Topics of interest are related to all aspects of descriptional complexity and much more.