株式会社極東書店トップ商品一覧Language and Automata Theory and Applications: 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. 2015 ed.

商品詳細

Language and Automata Theory and Applications: 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. 2015 ed.

Language and Automata Theory and Applications: 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. 2015 ed.

・ISBN 978-3-319-15578-4 paper EUR 49.99

¥13,361.- (税込) (※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。

お気に入り
著者・編者Dediu, Adrian-Horia / Formenti, Enrico / Martin-Vide, Carlos / Truthe, Bianca (eds.),
シリーズ (Lecture Notes in Computer Science)
出版社 (Springer International Publishing AG, SZ)
出版年月2015
ページ数754 pp.
言語ENG
ニュース番号<A05-16112>

解説

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.