Cantitate/Preț
Produs

Language and Automata Theory and Applications

Editat de Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe
en Limba Engleză Paperback – 10 mar 2015
This book constitutes the refereed proceedings of the 9th International Conference on Language and Automata Theory and Applications, LATA 2015, held in Nice, France in March 2015. The 53 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 115 submissions. The papers cover the following topics: algebraic language theory; algorithms for semi-structured data mining, algorithms on automata and words; automata and logic; automata for system analysis and program verification; automata networks, concurrency and Petri nets; automatic structures; cellular automata, codes, combinatorics on words; computational complexity; data and image compression; descriptional complexity; digital libraries and document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; parallel and regulated rewriting; parsing; patterns; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.
Citește tot Restrânge

Preț: 34525 lei

Preț vechi: 43157 lei
-20% Nou

Puncte Express: 518

Preț estimativ în valută:
6108 7127$ 5340£

Carte tipărită la comandă

Livrare economică 16-30 ianuarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319155784
ISBN-10: 3319155784
Pagini: 772
Ilustrații: XV, 754 p. 140 illus.
Dimensiuni: 155 x 235 x 42 mm
Greutate: 1.15 kg
Ediția:2015
Editura: Springer
Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Algorithms.- Automata, Logic, and Concurrency.- Codes, Semigroups, and Symbolic Dynamics.- Combinatorics on Words.- Complexity and Recursive Functions.- Compression, Inference, Pattern Matching, and Model Checking.- Graphs, Term Rewriting, and Networks.- Transducers, Tree Automata, and Weighted Automata.

Caracteristici

Includes supplementary material: sn.pub/extras