Cantitate/Preț
Produs
Total produse
Vezi coșul
Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings de Galina Jirásková

Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12442

Editat de Galina Jirásková, Giovanni Pighizzini
en Limba Engleză Paperback – 7 noi 2020
This book constitutes the proceedings of the 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, which was supposed to take place in Vienna, Austria, in August 2020, but the conference was canceled due to the COVID-19 crisis. The 19 full papers presented in this volume were carefully reviewed and selected from 31 submissions. 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ț: 31785 lei

Preț vechi: 39731 lei
-20% Nou

Puncte Express: 477
Preț estimativ în valută:
5624€ • 6611$ • 4925£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 26

 Adaugă în coș

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

Specificații

ISBN-13: 9783030625351
ISBN-10: 3030625354
Pagini: 245
Ilustrații: X, 245 p. 327 illus., 9 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.36 kg
Ediția:1st ed. 2020
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

Mutually Accepting Capacitated Automata.- Bad pictures: some structural properties related to overlaps.- Regular Expression Length via Arithmetic Formula Complexity.- Crisp-determinization of Weighted Tree Automata over Additively Locally Finite and Past-finite Monotonic Strong Bimonoids is Decidable.- On the Power of Generalized Forbidding Insertion-Deletion Systems.- State Complexity Bounds for the Commutative Closure of Group Languages.- Multiple Concatenation and State Complexity (Extended Abstract).- Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata.- Longer shortest strings in two-way finite automata.- Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion.- Descriptional Complexity of Winning Sets of Regular Languages.- State complexity of GF(2)-inverse and GF(2)-star on binary languages.- Complexity of Two-dimensional Rank-reducing Grammars.- Palindromic Length of Words with Many Periodic Palindromes.- Operational Complexity of Straight Line Programs for Regular Languages.- Classifying ω-Regular Aperiodic k-Partitions.- Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata.- On the Generative Power of Quasiperiods.- Insertion-Deletion Systems With Substitutions II.