Skip to main content
SpringerLink
Log in

Language and Automata Theory and Applications

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

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. Shmuel Tomi Klein

    1. Bar-Ilan University, Ramat Gan, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Carlos Martín-Vide

    1. Rovira i Virgili University, Tarragona, Spain

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Dana Shapira

    1. Ariel University, Ariel, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: LATA 2018.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (24 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Constraint Satisfaction Problems: Complexity and Algorithms

    • Andrei A. Bulatov
    Pages 1-25

  3. Sliding Window Algorithms for Regular Languages

    • Moses Ganardi, Danny Hucke, Markus Lohrey
    Pages 26-35

  4. Underlying Principles and Recurring Ideas of Formal Grammars

    • Alexander Okhotin
    Pages 36-59

  5. Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects

    • Eli Shamir
    Pages 60-67

  6. Formal Languages over GF(2)

    • Ekaterina Bakinova, Artem Basharin, Igor Batmanov, Konstantin Lyubort, Alexander Okhotin, Elizaveta Sazhneva
    Pages 68-79

  7. Event-Clock Nested Automata

    • Laura Bozzelli, Aniello Murano, Adriano Peron
    Pages 80-92

  8. On the Synchronization of Planar Automata

    • J. Andres Montoya, Christian Nolasco
    Pages 93-104

  9. Descriptional and Computational Complexity of the Circuit Representation of Finite Automata

    • Māris Valdats
    Pages 105-117

  10. Disturbance Decoupling in Finite Automata

    • Alexey Zhirabok, Alexey Shumsky
    Pages 118-129

  11. Default Logic and Bounded Treewidth

    • Johannes K. Fichte, Markus Hecher, Irina Schindler
    Pages 130-142

  12. A General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers

    • Stefan Gerdjikov
    Pages 143-155

  13. Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy

    • Demen Güler, Andreas Krebs, Klaus-Jörn Lange, Petra Wolf
    Pages 156-168

  14. Learners Based on Transducers

    • Sanjay Jain, Shao Ning Kuek, Eric Martin, Frank Stephan
    Pages 169-181

  15. Model Learning as a Satisfiability Modulo Theories Problem

    • Rick Smetsers, Paul Fiterău-Broştean, Frits Vaandrager
    Pages 182-194

  16. Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects

    • Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger
    Pages 195-206

  17. Bubble-Flip—A New Generation Algorithm for Prefix Normal Words

    • Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi
    Pages 207-219

  18. Permutations Sorted by a Finite and an Infinite Stack in Series

    • Murray Elder, Yoong Kuan Goh
    Pages 220-231

  19. On Periodicity Lemma for Partial Words

    • Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
    Pages 232-244

  20. Measuring Closeness Between Cayley Automatic Groups and Automatic Groups

    • Dmitry Berdinsky, Phongpitak Trakuldit
    Pages 245-257
Back to top

Other volumes

  1. Language and Automata Theory and Applications

Keywords

About this book

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.

Editors and Affiliations

  • Bar-Ilan University, Ramat Gan, Israel

    Shmuel Tomi Klein

  • Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  • Ariel University, Ariel, Israel

    Dana Shapira

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation