Developments in Language Theory: 25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12811
Editat de Nelma Moreira, Rogério Reisen Limba Engleză Paperback – 15 iul 2021
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ț: 315.78 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ț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 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.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 571.22 lei
Preț vechi: 714.03 lei
-20% Nou
Puncte Express: 857
Preț estimativ în valută:
109.32€ • 115.33$ • 91.11£
109.32€ • 115.33$ • 91.11£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030815073
ISBN-10: 3030815072
Pagini: 381
Ilustrații: XVII, 381 p. 52 illus., 12 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.56 kg
Ediția:1st ed. 2021
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: 3030815072
Pagini: 381
Ilustrații: XVII, 381 p. 52 illus., 12 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.56 kg
Ediția:1st ed. 2021
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
Invited Talks.- Morphic sequences versus automatic sequences.- Parsimonious Computational Completeness Pointlike sets and separation: a personal perspective.- Regular Papers.- A strong non-overlapping Dyck code.- Active Learning of Sequential Transducers with Side Information about the Domain.- Compositions of Constant Weighted Extended Tree Transducers.- Extremal Binary PFAs in a Cerny Family.- Variations on the Post Correspondence Problem for Free Groups.- Reducing local alphabet size in recognizable picture languages.- Properties of Graphs Specified by a Regular Language.- Balanced-by-construction regular and omega-regular languages.- Weighted Prefix Normal Words: Mind the Gap.- Two-Way Non-Uniform Finite Automata.- Integer Weighted Automata on Infinite Words.- Deciding FO2 Alternation for Automata over Finite and Infinite Words.- State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters.- Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata.- Lyndon words formalized in Isabelle/HOL.- The Range of State Complexities of Languages Resulting from the Cascade Product—The General Case (Extended Abstract).- Second-order finite automata: expressive power and simple proofs using automatic structures.- Reversible Top-Down Syntax Analysis.- Symmetry groups of infinite words.- Bounded Languages Described by GF(2)-grammas.- Definability Results for Top-Down Tree Transducers.- The hardest LL(k) language.- Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings.- Branching Frequency and Markov Entropy of Repetition-Free Languages.- A Linear-time Simulation of Deterministic d-Limited Automata.- Caratheodory Extensions of Subclasses of Regular Languages.- Parikh Word Representable Graphs and Morphisms.