Home
Descriptional Complexity of Formal Systems: 21st IFIP WG 1.02 International Conference, DCFS 2019, Kosice, Slovakia, July 17-19, Proceedings
Barnes and Noble
Loading Inventory...
Descriptional Complexity of Formal Systems: 21st IFIP WG 1.02 International Conference, DCFS 2019, Kosice, Slovakia, July 17-19, Proceedings in Chattanooga, TN
Current price: $54.99

Barnes and Noble
Descriptional Complexity of Formal Systems: 21st IFIP WG 1.02 International Conference, DCFS 2019, Kosice, Slovakia, July 17-19, Proceedings in Chattanooga, TN
Current price: $54.99
Loading Inventory...
Size: Paperback
This book constitutes the proceedings of the 21st International Conference on Descriptional Complexity of Format Systems, DCFS 2019, held in Košice, Slovakia, in July 2019.
The 18 full papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains 4 invited talks. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others.
The 18 full papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains 4 invited talks. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others.
This book constitutes the proceedings of the 21st International Conference on Descriptional Complexity of Format Systems, DCFS 2019, held in Košice, Slovakia, in July 2019.
The 18 full papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains 4 invited talks. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others.
The 18 full papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains 4 invited talks. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others.

















