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ț: 323.14 lei - 20%
Preț: 639.26 lei - 20%
Preț: 535.41 lei - 20%
Preț: 850.42 lei - 20%
Preț: 461.32 lei - 20%
Preț: 315.62 lei - 20%
Preț: 489.11 lei - 20%
Preț: 293.24 lei - 20%
Preț: 251.97 lei - 20%
Preț: 390.08 lei - 20%
Preț: 320.50 lei - 20%
Preț: 498.17 lei - 20%
Preț: 447.31 lei - 20%
Preț: 313.87 lei - 20%
Preț: 355.27 lei - 20%
Preț: 488.90 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 403.00 lei - 20%
Preț: 679.09 lei - 20%
Preț: 461.52 lei - 20%
Preț: 389.63 lei - 20%
Preț: 423.95 lei - 20%
Preț: 389.45 lei - 20%
Preț: 526.98 lei - 20%
Preț: 496.30 lei - 20%
Preț: 499.57 lei - 20%
Preț: 390.92 lei - 20%
Preț: 426.80 lei - 20%
Preț: 754.16 lei - 20%
Preț: 391.10 lei - 15%
Preț: 426.22 lei - 20%
Preț: 426.45 lei - 20%
Preț: 315.26 lei - 20%
Preț: 321.47 lei - 20%
Preț: 782.57 lei - 20%
Preț: 342.61 lei - 20%
Preț: 904.16 lei - 20%
Preț: 400.77 lei - 20%
Preț: 400.17 lei - 20%
Preț: 519.32 lei - 5%
Preț: 515.91 lei - 20%
Preț: 321.88 lei - 20%
Preț: 389.90 lei - 20%
Preț: 461.32 lei - 20%
Preț: 355.70 lei - 20%
Preț: 458.53 lei - 20%
Preț: 390.08 lei - 20%
Preț: 531.90 lei - 20%
Preț: 389.82 lei - 20%
Preț: 249.77 lei
Preț: 570.76 lei
Preț vechi: 713.45 lei
-20%
Puncte Express: 856
Preț estimativ în valută:
101.03€ • 117.78$ • 87.52£
101.03€ • 117.78$ • 87.52£
Carte tipărită la comandă
Livrare economică 27 februarie-13 martie
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.