Bild från Syndetics
Descriptional Complexity of Formal Systems [electronic resource] : 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25–27, 2018, Proceedings / edited by Stavros Konstantinidis, Giovanni Pighizzini.
Materialtyp:
TextSerie: Utgivningsuppgift: Cham : Springer International Publishing : Imprint: Springer, 2018Utgåva: 1st ed. 2018Beskrivning: XIV, 251 p. 35 illus. online resourceInnehållstyp: - text
- computer
- online resource
- 9783319946313
- Computer Science Logic and Foundations of Programming
- Natural Language Processing (NLP)
- Discrete Mathematics in Computer Science
- Data Science
- Computer science
- Natural language processing (Computer science)
- Computer science -- Mathematics
- Discrete mathematics
- Artificial intelligence -- Data processing
- 004.0151 23
Innehåll:
Sammanfattning: 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. .
Formal languages and automata theory -- State complexity -- Grammars -- Randomness -- Automata extensions -- Algebraic language theory.
Inga fysiska exemplar för denna post
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. .
Licensed e-book