Skip to main content
  • Conference proceedings
  • © 2016

Language and Automata Theory and Applications

10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings

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

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

Conference series link(s): LATA: International Conference on Language and Automata Theory and Applications

Conference proceedings info: LATA 2016.

Buy it now

Buying options

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

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

Table of contents (46 papers)

  1. Front Matter

    Pages I-XXII
  2. Invited Talks

    1. Front Matter

      Pages 1-1
    2. Non-Zero Sum Games for Reactive Synthesis

      • Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin et al.
      Pages 3-23
    3. Tangles and Connectivity in Graphs

      • Martin Grohe
      Pages 24-41
    4. Restricted Turing Machines and Language Recognition

      • Giovanni Pighizzini
      Pages 42-56
    5. Automata for Ontologies

      • Frank Wolter
      Pages 57-60
  3. Automata and Logic

    1. Front Matter

      Pages 61-61
    2. \(+\omega \)-Picture Languages Recognizable by Büchi-Tiling Systems

      • Parvaneh Babari, Nicole Schweikardt
      Pages 76-88
    3. A Logical Characterization for Dense-Time Visibly Pushdown Automata

      • Devendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade, Ashutosh Trivedi
      Pages 89-101
    4. A Complexity Measure on Büchi Automata

      • Dana Fisman
      Pages 102-113
    5. Compositional Bisimulation Minimization for Interval Markov Decision Processes

      • Vahid Hashemi, Holger Hermanns, Lei Song, K. Subramani, Andrea Turrini, Piotr Wojciechowski
      Pages 114-126
    6. A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem

      • Heiko Vogler, Manfred Droste, Luisa Herrmann
      Pages 127-139
  4. Automata and Words

    1. Front Matter

      Pages 141-141
    2. Colored Nested Words

      • Rajeev Alur, Dana Fisman
      Pages 143-155
    3. Input-Driven Queue Automata with Internal Transductions

      • Martin Kutrib, Andreas Malcher, Matthias Wendlandt
      Pages 156-167
    4. Periodic Generalized Automata over the Reals

      • Klaus Meer, Ameen Naif
      Pages 168-180
    5. Minimal Separating Sequences for All Pairs of States

      • Rick Smetsers, Joshua Moerman, David N. Jansen
      Pages 181-193
    6. Forkable Regular Expressions

      • Martin Sulzmann, Peter Thiemann
      Pages 194-206

Other Volumes

  1. Language and Automata Theory and Applications

About this book

This book constitutes the refereed proceedings of the 10th International Conference on Language and Automata Theory and Applications, LATA 2016, held in Prague, Czech Republic, in March 2016.

The 42 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 119 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.

Editors and Affiliations

  • Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu, Carlos Martín-Vide

  • Czech Technical University, Prague, Czech Republic

    Jan Janoušek

  • Justus Liebig University Giessen, Gießen, Germany

    Bianca Truthe

Bibliographic Information

Buy it now

Buying options

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