Skip to main content
  • Conference proceedings
  • © 2019

Language and Automata Theory and Applications

13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings

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

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 2019.

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 (34 papers)

  1. Front Matter

    Pages I-XVII
  2. Invited Papers

    1. Front Matter

      Pages 1-1
    2. Observation and Interaction

      • Edward A. Lee
      Pages 31-42
    3. From Words to Graphs, and Back

      • Vadim Lozin
      Pages 43-54
  3. Automata

    1. Front Matter

      Pages 55-55
    2. An Oracle Hierarchy for Small One-Way Finite Automata

      • M. Anabtawi, S. Hassan, C. Kapoutsis, M. Zakzok
      Pages 57-69
    3. Orbits of Abelian Automaton Groups

      • Tim Becker, Klaus Sutner
      Pages 70-81
    4. Bounded Automata Groups are co-ET0L

      • Alex Bishop, Murray Elder
      Pages 82-94
    5. Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata

      • Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara, Antonio E. Porreca
      Pages 95-107
    6. On Varieties of Ordered Automata

      • Ondřej Klíma, Libor Polák
      Pages 108-120
    7. Automata over Infinite Sequences of Reals

      • Klaus Meer, Ameen Naif
      Pages 121-133
    8. Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference

      • Ilya Zakirzyanov, Antonio Morgado, Alexey Ignatiev, Vladimir Ulyantsev, Joao Marques-Silva
      Pages 159-173
  4. Complexity

    1. Front Matter

      Pages 175-175
    2. Closure and Nonclosure Properties of the Compressible and Rankable Sets

      • Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery
      Pages 177-189
    3. State Complexity of Pseudocatenation

      • Lila Kari, Timothy Ng
      Pages 203-214
    4. Complexity of Regex Crosswords

      • Stephen Fenner, Daniel Padé
      Pages 215-230

Other Volumes

  1. Language and Automata Theory and Applications

About this book

This book constitutes the refereed proceedings of the 13th International Conference on Language and Automata Theory and Applications, LATA 2019, held in St. Petersburg, Russia, in March 2019.

The 31 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 98 submissions. The papers cover the following topics: Automata; Complexity; Grammars; Languages; Graphs, trees and rewriting; and Words and codes.

Editors and Affiliations

  • Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  • Saint Petersburg State University, St. Petersburg, Russia

    Alexander Okhotin

  • Ariel University, Ariel, Israel

    Dana Shapira

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