Cantitate/Preț
Produs
Total produse
Vezi coșul
Language and Automata Theory and Applications: 14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings de Alberto Leporati

Language and Automata Theory and Applications: 14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12038

Editat de Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron
en Limba Engleză Paperback – 5 feb 2020
This book constitutes the proceedings of the 14th International Conference on Language and Automata Theory and Applications, LATA 2020, which was planned to be held in Milan, Italy, in March 2020. Due to the corona pandemic, the actual conference was postponed and will be held together with LATA 2021.

The 26 full papers presented in this volume were carefully reviewed and selected from 59 submissions. They were organized in topical sections named: algebraic structures; automata; complexity; grammars; languages; trees and graphs; and words and codes. The book also contains 6 invited papers in full-paper length. 
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32261 lei  6-8 săpt.
  Springer International Publishing – 19 feb 2021 32261 lei  6-8 săpt.
  Springer International Publishing – 5 feb 2020 32767 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 32767 lei

Preț vechi: 40959 lei
-20% Nou

Puncte Express: 492
Preț estimativ în valută:
5798€ • 6808$ • 5089£

Carte tipărită la comandă

Livrare economică 28 ianuarie-11 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030406073
ISBN-10: 3030406075
Pagini: 449
Ilustrații: XI, 449 p. 409 illus., 6 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.64 kg
Ediția:1st ed. 2020
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 papers.- The New Complexity Landscape around Circuit Minimization.- Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases.- Approaching Arithmetic Theories with Finite-State Automata.- Recompression: technique for word equations and compressed data.- How to prove that a language is regular or star-free.- Deciding classes of regular languages: the covering approach.- Algebraic Structures.- Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles Over the Circle.- Deciding (R,+, < ,1) in (R,+, < ,Z).- Ordered Semiautomatic Rings with Applications to Geometry.- Automata.- Boolean monadic recursive schemes as a logical characterization of the subsequential functions.- Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models.- Windable Heads & Recognizing NL with Constant Randomness.- Alternating Finite Automata with Limited Universal Branching.- Pebble-Intervals Automata and FO2 with Two Orders.- Limited Two-Way Deterministic Finite Automata with Advice.- Complexity.- On the size of depth-two threshold circuits for the inner product mod 2 function.- Complexity Issues of String to Graph Approximate Matching.- Complexity of Automatic Sequences.- Grammars.- Context-sensitive Fusion Grammars are Universal.- Cyclic shift on multi-component grammars.- Languages.- The Automatic Baire Property and an Effective Property of omega-Rational Functions.- The Power of Programs over Monoids in J.- Geometrically Closed Positive Varieties of Star-Free Languages.- Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas.- Trees and Graphs.- On the Weisfeiler-Leman Dimension of Fractional Packing.- Input Strictly Local Tree Transducers.- Words and Codes.- Lyndon words versus inverse Lyndon words: queries on su xes and bordered words.- On collapsing pre x normal words.- Simplified Parsing Expression Derivatives.- Complete Variable-Length Codes: AnExcursion into Word Edit Operations.