DLT2021: 25TH INTERNATIONAL CONFERENCE ON DEVELOPMENTS IN LANGUAGE THEORY 2021

A
Allouche, Jean-Paul	Morphic sequences versus automatic sequences
Amrane, Amazigh	Equational Theories of Scattered and Countable Series-parallel Posets
B
Barcucci, Elena	A strong non-overlapping Dyck code
Barker, Laura	Scattered Factor-Universality of Words
Bedon, Nicolas	Equational Theories of Scattered and Countable Series-parallel Posets
Bera, Somnath	Parikh Word Representable Graphs and Morphisms
Bernini, Antonio	A strong non-overlapping Dyck code
Berthon, Raphaël	Active Learning of Sequential Transducers with Side Information about the Domain
Blattmann, Malte	Compositions of Constant Weighted Extended Tree Transducers
Boiret, Adrien	Active Learning of Sequential Transducers with Side Information about the Domain
C
Cambie, Stijn	Extremal Binary PFAs in a Cerny Family
Caron, Pascal	A Study of a Simple Class of Modifiers: Product Modifiers
Cheon, Hyunjoon	Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
Chouraqui, Fabienne	An approach to the Herzog-Schonheim conjecture using automata
Ciobanu, Laura	Variations on the Post Correspondence Problem for free groups
Crespi Reghizzi, Stefano	Reducing local alphabet size in recognizable picture languages
D
de Bondt, Michiel	Extremal Binary PFAs in a Cerny Family
de Oliveira Oliveira, Mateus	On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection
Diekert, Volker	Properties of Graphs Specified by a Regular Language
Don, Henk	Extremal Binary PFAs in a Cerny Family
E
Edixhoven, Luc	Balanced-by-construction regular and omega-regular languages
Eikmeier, Yannik	Weighted Prefix Normal Words: Mind the Gap
F
Fernau, Henning	Parsimonious Computational Completeness Properties of Graphs Specified by a Regular Language
Fleischer, Lukas	The State Complexity of Lexicographically Smallest Words and Computing Successors
Fleischmann, Pamela	Weighted Prefix Normal Words: Mind the Gap Reconstructing Words from Right-Bounded-Block Words Scattered Factor-Universality of Words
Frei, Fabian	Two-Way Non-Uniform Finite Automata
Frosini, Andrea	The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness
H
Halava, Vesa	Integer Weighted Automata on Infinite Words
Hamel-de le Court, Edwin	A Study of a Simple Class of Modifiers: Product Modifiers
Han, Yo-Sub	Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
Harju, Tero	Integer Weighted Automata on Infinite Words
Harwardt, Katharina	Scattered Factor-Universality of Words
Henriksson, Viktor	Deciding FO2 Alternation for Automata over Finite and Infinite Words
Hoffmann, Stefan	State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
Holub, Štěpán	Lyndon words formalized in Isabelle/HOL
Holzer, Markus	The Range of State Complexities of Languages Resulting from the Cascade Product---The General Case (Extended Abstract)
Hospodár, Michal	Operations on Permutation Automata
Hromkovic, Juraj	Two-Way Non-Uniform Finite Automata
I
Ibarra, Oscar	Space Complexity of Stack Automata Models
J
Jirásek, Jozef	Space Complexity of Stack Automata Models
Jongmans, Sung-Shik	Balanced-by-construction regular and omega-regular languages
K
Koechlin, Florent	On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
Koucký, Michal	Computing Edit Distance
Kralovic, Rastislav	Two-Way Non-Uniform Finite Automata
Kralovic, Richard	Two-Way Non-Uniform Finite Automata
Kufleitner, Manfred	Deciding FO2 Alternation for Automata over Finite and Infinite Words
Kulczynski, Mitja	Weighted Prefix Normal Words: Mind the Gap
Kuske, Dietrich	Second-order finite automata: expressive power and simple proofs using automatic structures
Kutrib, Martin	Reversible Top-Down Syntax Analysis
L
Lejeune, Marie	Reconstructing Words from Right-Bounded-Block Words
Lietard, Florian	Avoidability of Additive Cubes over Alphabets of Four Numbers
Logan, Alan D.	Variations on the Post Correspondence Problem for free groups
Luchinin, Sergey	Symmetry groups of infinite words
Luque, Jean-Gabriel	A Study of a Simple Class of Modifiers: Product Modifiers
Luttenberger, Michael	On the Balancedness of Tree-to-word Transducers Equivalence of Linear Tree Transducers with Output in the Free Group
Löbel, Raphaela	On the Balancedness of Tree-to-word Transducers Equivalence of Linear Tree Transducers with Output in the Free Group
M
Makarov, Vladislav	Bounded Languages Described by GF(2)-grammars
Maletti, Andreas	Compositions of Constant Weighted Extended Tree Transducers On Tree Substitution Grammars
Manea, Florin	Reconstructing Words from Right-Bounded-Block Words Scattered Factor-Universality of Words
Maneth, Sebastian	Definability Results for Top-Down Tree Transducers
Mathew, Lisa	Parikh Word Representable Graphs and Morphisms
McQuillan, Ian	Space Complexity of Stack Automata Models
Meyer, Uwe	Reversible Top-Down Syntax Analysis
Mlynárčik, Peter	Operations on Permutation Automata
Modanese, Augusto	Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
Mrykhin, Mikhail	The hardest LL(k) language
N
Nagar, Atulya	Parikh Word Representable Graphs and Morphisms
Nicaud, Cyril	On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
Niskanen, Reino	Integer Weighted Automata on Infinite Words
Nowotka, Dirk	Weighted Prefix Normal Words: Mind the Gap Reconstructing Words from Right-Bounded-Block Words Scattered Factor-Universality of Words
O
Okhotin, Alexander	The hardest LL(k) language
P
Pape-Lange, Julian	Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings
Perez, Guillermo	Active Learning of Sequential Transducers with Side Information about the Domain
Petrova, Elena	Branching Frequency and Markov Entropy of Repetition-Free Languages
Pinzani, Renzo	A strong non-overlapping Dyck code
Potapov, Igor	Integer Weighted Automata on Infinite Words
Prigioniero, Luca	Space Complexity of Stack Automata Models
Průša, Daniel	Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
Puzynina, Svetlana	Symmetry groups of infinite words
R
Raskin, Jean-Francois	Active Learning of Sequential Transducers with Side Information about the Domain
Rauch, Christian	The Range of State Complexities of Languages Resulting from the Cascade Product---The General Case (Extended Abstract)
Restivo, Antonio	Reducing local alphabet size in recognizable picture languages
Rigo, Michel	Reconstructing Words from Right-Bounded-Block Words
Rosenfeld, Matthieu	Avoidability of Additive Cubes over Alphabets of Four Numbers
Rotondo, Pablo	On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
Rubtsov, Alexander	A Linear-time Simulation of Deterministic d-Limited Automata
S
San Pietro, Pierluigi	Reducing local alphabet size in recognizable picture languages
Seidl, Helmut	On the Balancedness of Tree-to-word Transducers Equivalence of Linear Tree Transducers with Output in the Free Group
Seidl, Helmut	Definability Results for Top-Down Tree Transducers
Shallit, Jeffrey	The State Complexity of Lexicographically Smallest Words and Computing Successors
Shur, Arseny	Branching Frequency and Markov Entropy of Repetition-Free Languages
Silva, Alexandra	Guarded Kleene Algebra with Tests
Sin'Ya, Ryoma	Caratheodory Extensions of Subclasses of Regular Languages Context-Freeness of Word-MIX Languages
Starosta, Štěpán	Lyndon words formalized in Isabelle/HOL
Steinberg, Benjamin	Pointlike sets and separation: a personal perspective
Stier, Kevin	On Tree Substitution Grammars
Subramanian, K G	Parikh Word Representable Graphs and Morphisms
T
Tarsissi, Lama	The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness
Thomas, Nobin	Parikh Word Representable Graphs and Morphisms
V
Vu, Viet Anh Martin	Definability Results for Top-Down Tree Transducers
W
Wehar, Michael	On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
Wolf, Petra	Properties of Graphs Specified by a Regular Language

Disclaimer | Powered by EasyChair Smart Program