Developments in Language Theory: 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ț: 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ț: 574.14 lei
Preț vechi: 717.67 lei
-20%
Puncte Express: 861
Preț estimativ în valută:
101.53€ • 116.42$ • 87.74£
101.53€ • 116.42$ • 87.74£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783030815073
ISBN-10: 3030815072
Pagini: 400
Ilustrații: XVII, 381 p. 52 illus., 12 illus. in color.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3030815072
Pagini: 400
Ilustrații: XVII, 381 p. 52 illus., 12 illus. in color.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
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.