Accepted Papers

  • Da-Jung Cho and Tikhon Pshenitsyn
    A Comparative Analysis of Deletion Closure Operations and Their Properties

  • Ruben Becker, Giuseppa Castiglione, Giovanna D’Agostino, Alberto Policriti, Nicola Prezza, Antonio Restivo and Brian Riccardi
    Universally Wheeler Languages

  • Oscar Ibarra and Ian McQuillan
    Relativized Codes, Finite Decodability, and Bounded Languages

  • Giovanni Pighizzini
    Turn Complexity of Context-free Languages, Pushdown and One-Counter Automata

  • Yusuke Inoue and Yuji Komatsu
    Positive Varieties of Lattice Languages

  • Semyon Petrov and Alexander Okhotin
    On the transformation of two-way nondeterministic finite automata to unambiguous finite automata

  • Brennan Lockinger and Ian McQuillan
    Left Quotients of Deterministic Context-Free Languages

  • Vladislav Makarov
    Checking whether two unambiguous grammars describe the same set of strings of length n

  • Bruno Guillon, Luca Prigioniero and Javad Taheri
    Nondeterminism Makes Unary 1-Limited Automata Concise

  • Mohammad Zakzok and Kai Salomaa
    Improved Upper Bounds for Determinizing NIDPDAs with Limited Nondeterminism

  • Sungmin Kim and Yo-Sub Han
    Pattern mining under Simon’s congruence

  • Markus Schmid
    A General Information Extraction Framework Based on Formal Languages

  • Kord Eickmeyer and Georg Schindling
    Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words

  • Martin Kutrib, Priscilla Raucci and Matthias Wendlandt
    Subregular Expressions with Two Operations

  • Eva Foster, Aleksi Saarela and Aleksi Vanhatalo
    Mapped Exponent and Asymptotic Critical Exponent of Words

  • Pamela Fleischmann, Annika Huch, Melf Kammholz and Tore Koß
    Jumbled Scattered Factors

  • Florent Koechlin, Carine Pivoteau and Pablo Rotondo
    Heuristic universality detection over regular expressions specified by systems

  • Nicola Cotumaccio
    Sorting Circular Suffixes in Linear Time