Cantitate/Preț
Produs
Total produse
Vezi coșul
Descriptional Complexity of Formal Systems: 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019, Proceedings de Michal Hospodár

Descriptional Complexity of Formal Systems: 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019, Proceedings: Lecture Notes in Computer Science, cartea 11612

Editat de Michal Hospodár, Galina Jirásková, Stavros Konstantinidis
en Limba Engleză Paperback – 26 iun 2019
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. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32652 lei

Preț vechi: 40815 lei
-20% Nou

Puncte Express: 490
Preț estimativ în valută:
6249€ • 6491$ • 5191£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030232467
ISBN-10: 3030232468
Pagini: 260
Ilustrații: X, 299 p. 230 illus., 5 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.44 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

A General Framework for Sequential Grammars with Control Mechanisms.- Low-Complexity Tilings of the Plane.- Union-Freeness, Deterministic Union-Freeness and Union-Complexity.- Limited Automata: Properties, Complexity and Variants.- Nondeterministic Right One-Way Jumping Finite Automata.- State Complexity of Single-Word Pattern Matching in Regular Languages.- Square, Power, Positive Closure, and Complementation on Star-Free Languages.- Descriptional Complexity of Matrix Simple Semi-Conditional Grammars.- Regulated Tree Automata.- Generalized de Bruijn Words and the State Complexity of Conjugate Sets.- The Syntactic Complexity of Semi-Flower Languages.- Limited Nondeterminism of Input-Driven Pushdown Automata Decidability and Complexity.- Computability on Quasi-Polish Spaces.- NFA-to-DFA Trade-Off for Regular Operations.- State Complexity of Simple Splicing.- Nondeterminism Growth and State Complexity.- Descriptional Complexity of Iterated Uniform Finite State Transducers.-On Classes of Regular Languages Related to Monotone WQOs.- State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages.- Pushdown Automata and Constant Height: Decidability and Bounds.- On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances.- How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory.