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 Pighizzinien Limba Engleză Paperback – 7 noi 2020
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 321.96 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 315.78 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.19 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 318.00 lei
Preț vechi: 397.50 lei
-20% Nou
Puncte Express: 477
Preț estimativ în valută:
60.86€ • 63.99$ • 50.62£
60.86€ • 63.99$ • 50.62£
Carte tipărită la comandă
Livrare economică 27 decembrie 24 - 10 ianuarie 25
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
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.