Descriptional Complexity of Formal Systems: Lecture Notes in Computer Science, cartea 13439
Editat de Yo-Sub Han, György Vaszilen Limba Engleză Paperback – aug 2022
The 14 full papers presented in this volume were carefully reviewed and selected from 17 submissions. The book also contains 4 invited talks. The conference focus to all aspects of descriptional complexity including Automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 459.38 lei
Preț vechi: 574.24 lei
-20%
Puncte Express: 689
Preț estimativ în valută:
81.23€ • 93.17$ • 70.23£
81.23€ • 93.17$ • 70.23£
Carte disponibilă
Livrare economică 08-22 aprilie
Livrare express 24-28 martie pentru 29.64 lei
Specificații
ISBN-13: 9783031132568
ISBN-10: 3031132564
Pagini: 244
Ilustrații: XXVIII, 213 p. 47 illus., 1 illus. in color.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.38 kg
Ediția:1st edition 2022
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031132564
Pagini: 244
Ilustrații: XXVIII, 213 p. 47 illus., 1 illus. in color.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.38 kg
Ediția:1st edition 2022
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages.- Ranking Binary Unlabelled Necklaces in Polynomial Time.- On the Power of Recursive Word-Functions without Concatenation.- Clusters of Repetition Roots Forming Prefix Chains.- Nearly k-Universal Words - Investigating a Part of Simon’s Congruence.- State Complexity of Binary Coded Regular Languages.- Reset Complexity and Completely Reachable Automata with Simple Idempotents.- On the Descriptional Complexity of the Direct Product of Finite Automata.- Operations on Subregular Languages and Nondeterministic State Complexity.- On Simon’s Congruence Closure of a String.- Approximate NFA Universality Motivated by Information Theory.- Lazy Regular Sensing.- State Complexity of Finite Partial Languages.- Yet Another Canonical Nondeterministic Automaton.- Union-Complexities of Kleene Plus Operation.