Accepted Papers

Instructions for Authors of Papers to be Published in Springer Computer Science Proceedings

Sebastian Maneth, Helmut Seidl and Viet Anh Martin Vu. Definability Results for Top-Down Tree Transducers
Dietrich Kuske. Second-order finite automata: expressive power and simple proofs using automatic structures
Ryoma Sin'Ya. Caratheodory Extensions of Subclasses of Regular Languages
Yannik Eikmeier, Pamela Fleischmann, Mitja Kulczynski and Dirk Nowotka. Weighted Prefix Normal Words: Mind the Gap
Laura Ciobanu and Alan D. Logan. Variations on the Post Correspondence Problem for free groups
Stefan Hoffmann. State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters
Stefan Hoffmann. Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
Nobin Thomas, Lisa Mathew, Somnath Bera, Atulya Nagar and K G Subramanian. Parikh Word Representable Graphs and Morphisms
Alexander Rubtsov. A Linear-time Simulation of Deterministic d-Limited Automata
Elena Barcucci, Antonio Bernini and Renzo Pinzani. A strong non-overlapping Dyck code
Stijn Cambie, Michiel de Bondt and Henk Don. Extremal Binary PFAs in a Cerny Family
Stefano Crespi Reghizzi, Antonio Restivo and Pierluigi San Pietro. Reducing local alphabet size in recognizable picture languages
Sergey Luchinin and Svetlana Puzynina. Symmetry groups of infinite words
Raphaël Berthon, Adrien Boiret, Guillermo Perez and Jean-Francois Raskin. Active Learning of Sequential Transducers with Side Information about the Domain
Julian Pape-Lange. Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings
Fabian Frei, Juraj Hromkovic, Rastislav Kralovic and Richard Kralovic. Two-Way Non-Uniform Finite Automata
Volker Diekert, Henning Fernau and Petra Wolf. Properties of Graphs Specified by a Regular Language
Vesa Halava, Tero Harju, Reino Niskanen and Igor Potapov. Integer Weighted Automata on Infinite Words
Štěpán Holub and Štěpán Starosta. Lyndon words formalized in Isabelle/HOL
Martin Kutrib and Uwe Meyer. Reversible Top-Down Syntax Analysis
Luc Edixhoven and Sung-Shik Jongmans. Balanced-by-construction regular and omega-regular languages
Elena Petrova and Arseny Shur. Branching Frequency and Markov Entropy of Repetition-Free Languages
Vladislav Makarov. Bounded Languages Described by GF(2)-grammars
Viktor Henriksson and Manfred Kufleitner. Deciding FO2 Alternation for Automata over Finite and Infinite Words
Markus Holzer and Christian Rauch. The Range of State Complexities of Languages Resulting from the Cascade Product---The General Case (Extended Abstract)
Mikhail Mrykhin and Alexander Okhotin. The hardest LL(k) language
Malte Blattmann and Andreas Maletti. Compositions of Constant Weighted Extended Tree Transducers


 

Instructions for Authors of Papers to be Published in Springer Computer Science Proceedings

Camera-ready instructions

  • Please take carefully into account the suggestions of the reviewers and make the necessary modifications to your paper.
  • Follow the authors’ guidelines; prepare your bibliography using BibTex together with the style splncs04.bst provided by Springer.
  • Authors should include their ORCID identifier in the header of their paper.
  • LNCS recommends keywords, to be added after the abstract.
  • The page limit is 12 and is strict.
  • Fill in the copyright form. This copyright form is already partially filled in (with the title of the book and the volume editors). It is sufficient for one of the authors to sign the copyright form.
  • Upload your files using your EasyChair author account; follow the instructions after login for uploading three files:
  • - a zip archive with your source files,
  • - a pdf version of your paper,
  • - the signed copyright form.
  • All papers must be uploaded until June, 7th (strict)
  • At least one author per paper should register at the conference until June 7th