Developments in Language Theory: 27th International Conference, DLT 2023, Umeå, Sweden, June 12–16, 2023, Proceedings: 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ț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 416.96 lei
Preț vechi: 521.20 lei
-20% Nou
Puncte Express: 625
Preț estimativ în valută:
79.79€ • 82.80$ • 66.69£
79.79€ • 82.80$ • 66.69£
Carte tipărită la comandă
Livrare economică 15-29 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031332630
ISBN-10: 3031332636
Pagini: 259
Ilustrații: XX, 259 p. 71 illus., 34 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.4 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031332636
Pagini: 259
Ilustrații: XX, 259 p. 71 illus., 34 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.4 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
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.