Developments in Language Theory: Lecture Notes in Computer Science, cartea 13911
Editat de Frank Drewes, Mikhail Volkoven Limba Engleză Paperback – 19 mai 2023
The 20 full papers included in this book were carefully reviewed and selected from 32 submissions (31 regular ones and one invited).The DLT conference series provides a forum for presenting current developments informal languages and automata. Its scope is very general and includes, among others, the following topics and areas: grammars, acceptors and transducers for words; trees and graphs; relations between formal languages and artificial neural networks; algebraic theories of automata; algorithmic, combinatorial, and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; groups and semigroups generated by automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory, and logic; bio-inspired computing; and quantum computing.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 733.68 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 449.81 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 850.42 lei - 20%
Preț: 386.08 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 620.33 lei - 20%
Preț: 620.33 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 558.53 lei - 20%
Preț: 435.28 lei - 20%
Preț: 748.63 lei - 20%
Preț: 633.70 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 675.83 lei - 20%
Preț: 678.21 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 560.93 lei - 20%
Preț: 556.96 lei - 20%
Preț: 313.10 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 15%
Preț: 558.12 lei - 20%
Preț: 563.29 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 560.93 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 20%
Preț: 562.49 lei - 15%
Preț: 672.87 lei - 20%
Preț: 571.88 lei - 20%
Preț: 478.59 lei - 20%
Preț: 984.64 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei - 20%
Preț: 313.87 lei - 20%
Preț: 314.86 lei - 20%
Preț: 793.92 lei - 18%
Preț: 945.44 lei
Preț: 403.44 lei
Preț vechi: 504.31 lei
-20%
Puncte Express: 605
Preț estimativ în valută:
71.34€ • 81.81$ • 61.66£
71.34€ • 81.81$ • 61.66£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783031332630
ISBN-10: 3031332636
Pagini: 280
Ilustrații: XX, 259 p. 71 illus., 34 illus. in color.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.43 kg
Ediția:1st edition 2023
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031332636
Pagini: 280
Ilustrații: XX, 259 p. 71 illus., 34 illus. in color.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.43 kg
Ediția:1st edition 2023
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Transducers and the Power of Delay.- When the Map is More Exact than the Terrain.- Formal Languages and the NLP Black Box.- On Structural Tractability Parameters for Hard String Problems.- Jumping Automata over Infinite Words.- Isometric Words based on Swap and Mismatch Distance.- Set Augmented Finite Automata over Infinite Alphabets.- Fast detection of specific fragments against a set of sequences.- Weak Inverse Neighborhoods of Languages.- The exact state complexity for the composition of Root and reversal.- Bit catastrophes for the Burrows-Wheeler Transform.- The Domino problem is undecidable on every rhombus subshift.- Synchronization of Parikh Automata.- Completely Distinguishable Automata and the Set of Synchronizing Words.- Zielonka DAG Acceptance and Regular Languages over Infinite Words.- On Word Representable and Multi-Word Representable Graphs.- On the Simon's Congruence Neighborhood of Languages.- Tree-Walking-Storage Automata.- Rewriting rules for arithmetics in alternate base systems.- Synchronizing Automata with Coinciding Cycles.- Approaching Repetition Thresholds Via Local Resampling and Entropy Compression.- Languages Generated by Conjunctive Query Fragments of FC[REG].- Groups whose word problems are accepted by abelian G-automata.