Language and Automata Theory and Applications

12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings

  • Shmuel Tomi Klein
  • Carlos Martín-Vide
  • Dana Shapira
Conference proceedings LATA 2018

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10792)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10792)

Table of contents

  1. Front Matter
    Pages I-X
  2. Moses Ganardi, Danny Hucke, Markus Lohrey
    Pages 26-35
  3. Ekaterina Bakinova, Artem Basharin, Igor Batmanov, Konstantin Lyubort, Alexander Okhotin, Elizaveta Sazhneva
    Pages 68-79
  4. Laura Bozzelli, Aniello Murano, Adriano Peron
    Pages 80-92
  5. J. Andres Montoya, Christian Nolasco
    Pages 93-104
  6. Alexey Zhirabok, Alexey Shumsky
    Pages 118-129
  7. Johannes K. Fichte, Markus Hecher, Irina Schindler
    Pages 130-142
  8. Demen Güler, Andreas Krebs, Klaus-Jörn Lange, Petra Wolf
    Pages 156-168
  9. Sanjay Jain, Shao Ning Kuek, Eric Martin, Frank Stephan
    Pages 169-181
  10. Rick Smetsers, Paul Fiterău-Broştean, Frits Vaandrager
    Pages 182-194
  11. Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger
    Pages 195-206
  12. Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
    Pages 207-219
  13. Murray Elder, Yoong Kuan Goh
    Pages 220-231
  14. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
    Pages 232-244
  15. Dmitry Berdinsky, Phongpitak Trakuldit
    Pages 245-257

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 12th International Conference on Language and Automata Theory and Applications, LATA 2018, held in Ramat Gan, Israel, in April 2018.
The 20 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 58 submissions. The papers cover fields like algebraic language theory, algorithms for semi-structured data mining, algorithms on automata and words, automata and logic, automata for system analysis and programme verification, automata networks, automatic structures, codes, combinatorics on words, computational complexity, concurrency and Petri nets, data and image compression, descriptional complexity, foundations of finite state technology, foundations of XML, grammars (Chomsky hierarchy, contextual, unification, categorial, etc.), grammatical inference and algorithmic learning, graphs and graph transformation, language varieties and semigroups, language-based cryptography, mathematical and logical foundations of programming methodologies, parallel and regulated rewriting, parsing, patterns, power series, string processing algorithms, symbolic dynamics, term rewriting, transducers, trees, tree languages and tree automata, and weighted automata.

Keywords

formal language automation theoretical computer science grammar algorithms strings combinatorics complexity graphs parsing patterns learning transducer trees Semantics Automata theory Finite automata Graph theory Petri nets

Editors and affiliations

  1. 1.Bar-Ilan UniversityRamat GanIsrael
  2. 2.Rovira i Virgili UniversityTarragonaSpain
  3. 3.Ariel UniversityArielIsrael

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-77313-1
  • Copyright Information Springer International Publishing AG, part of Springer Nature 2018
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-77312-4
  • Online ISBN 978-3-319-77313-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Aerospace
IT & Software