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

This page contains an index consisting of author-provided keywords.

A
Abelian-power-free language	Branching Frequency and Markov Entropy of Repetition-Free Languages
active learning	Active Learning of Sequential Transducers with Side Information about the Domain
Additive equivalence	Avoidability of Additive Cubes over Alphabets of Four Numbers
Additive powers	Avoidability of Additive Cubes over Alphabets of Four Numbers
Arnoux-Rauzy words	Symmetry groups of infinite words
Automata	Deciding FO2 Alternation for Automata over Finite and Infinite Words An approach to the Herzog-Schonheim conjecture using automata
automata theory	A Linear-time Simulation of Deterministic d-Limited Automata Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
automatic classes	Second-order finite automata: expressive power and simple proofs using automatic structures
automatic structures	Second-order finite automata: expressive power and simple proofs using automatic structures
B
Balance property	The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness
Boolean matrix	Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
Boolean operations	A Study of a Simple Class of Modifiers: Product Modifiers
bounded languages	Bounded Languages Described by GF(2)-grammars
C
cascade product	The Range of State Complexities of Languages Resulting from the Cascade Product---The General Case (Extended Abstract)
Cellular Automata	Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
Cerny conjecture	Extremal Binary PFAs in a Cerny Family
Christofel words	The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness
classes of languages	Second-order finite automata: expressive power and simple proofs using automatic structures
Closures	On Tree Substitution Grammars
combinatorial systems	On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
Combinatorics on words	Lyndon words formalized in Isabelle/HOL Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings Weighted Prefix Normal Words: Mind the Gap Reconstructing Words from Right-Bounded-Block Words Avoidability of Additive Cubes over Alphabets of Four Numbers Scattered Factor-Universality of Words
Comma-free picture codes	Reducing local alphabet size in recognizable picture languages
commutative automata	State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters
Composition	Compositions of Constant Weighted Extended Tree Transducers
Compressed strings	Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings
Computational capacity	Reversible Top-Down Syntax Analysis
computational complexity	Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
constrained synchronization	Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
context-free grammars	The hardest LL(k) language
Context-free languages	Context-Freeness of Word-MIX Languages
Continued fractions	The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness
Coset partitions	An approach to the Herzog-Schonheim conjecture using automata
Cross bifix-free codes	A strong non-overlapping Dyck code
D
Decidability	Compositions of Constant Weighted Extended Tree Transducers Context-Freeness of Word-MIX Languages
Decision procedures	On Tree Substitution Grammars
descriptional complexity	The Range of State Complexities of Languages Resulting from the Cascade Product---The General Case (Extended Abstract)
Dyck Language	Balanced-by-construction regular and omega-regular languages On the Balancedness of Tree-to-word Transducers
Dyck paths	A strong non-overlapping Dyck code
E
Edit-distance	Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
emptiness problem	Integer Weighted Automata on Infinite Words
expressions as trees	On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
Extended tree transducer	Compositions of Constant Weighted Extended Tree Transducers
F
Finite automata	The Range of State Complexities of Languages Resulting from the Cascade Product---The General Case (Extended Abstract) Extremal Binary PFAs in a Cerny Family A Linear-time Simulation of Deterministic d-Limited Automata State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection A Study of a Simple Class of Modifiers: Product Modifiers
finite fields	Bounded Languages Described by GF(2)-grammars
first-order logic	Deciding FO2 Alternation for Automata over Finite and Infinite Words
forbidden patterns	Deciding FO2 Alternation for Automata over Finite and Infinite Words
formal grammars	Bounded Languages Described by GF(2)-grammars
formal language theory	Caratheodory Extensions of Subclasses of Regular Languages
Free algebra	Equational Theories of Scattered and Countable Series-parallel Posets
Free group	Variations on the Post Correspondence Problem for free groups Equivalence of Linear Tree Transducers with Output in the Free Group
Free groups	An approach to the Herzog-Schonheim conjecture using automata
G
Graph properties	Properties of Graphs Specified by a Regular Language
Graphs	Parikh Word Representable Graphs and Morphisms
graybox learning	Active Learning of Sequential Transducers with Side Information about the Domain
H
hardest languages	The hardest LL(k) language
homomorphism	Definability Results for Top-Down Tree Transducers
homomorphisms	The hardest LL(k) language
I
infinite words	Deciding FO2 Alternation for Automata over Finite and Infinite Words Integer Weighted Automata on Infinite Words Symmetry groups of infinite words
inherent ambiguity	Bounded Languages Described by GF(2)-grammars
Isabelle/HOL	Lyndon words formalized in Isabelle/HOL
K
k-spectrum	Scattered Factor-Universality of Words
L
Lexicographically smallest words	The State Complexity of Lexicographically Smallest Words and Computing Successors
limited automata	A Linear-time Simulation of Deterministic d-Limited Automata
linear	Definability Results for Top-Down Tree Transducers
linear-time algorithm	A Linear-time Simulation of Deterministic d-Limited Automata
LL grammars	The hardest LL(k) language
LL(k) languages	Reversible Top-Down Syntax Analysis
Local picture language	Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
Local Testability	Reducing local alphabet size in recognizable picture languages
Longest common reduced suffix	On the Balancedness of Tree-to-word Transducers
Lookahead	Reversible Top-Down Syntax Analysis
Lyndon factorization	Lyndon words formalized in Isabelle/HOL
Lyndon word	Lyndon words formalized in Isabelle/HOL
M
magic number	The Range of State Complexities of Languages Resulting from the Cascade Product---The General Case (Extended Abstract)
Markov entropy	Branching Frequency and Markov Entropy of Repetition-Free Languages
Maximal repetitions	Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings
Maximal subrepetitions	Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings
measure theory	Caratheodory Extensions of Subclasses of Regular Languages
Medvedev Theorem	Reducing local alphabet size in recognizable picture languages
Morphisms	Parikh Word Representable Graphs and Morphisms
N
Non-emptyness of intersection	On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection
Non-Uniformity	Two-Way Non-Uniform Finite Automata
O
operation problem	The Range of State Complexities of Languages Resulting from the Cascade Product---The General Case (Extended Abstract)
Operational State complexity	Operations on Permutation Automata The State Complexity of Lexicographically Smallest Words and Computing Successors
ordered monoids	Deciding FO2 Alternation for Automata over Finite and Infinite Words
P
P Time	Equivalence of Linear Tree Transducers with Output in the Free Group
Parameterized complexity	On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection
parsing	The hardest LL(k) language
Parsing expression grammar	Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
Periodic semigroups	Properties of Graphs Specified by a Regular Language
Permutation automata	State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters Operations on Permutation Automata
Picture languages	Reducing local alphabet size in recognizable picture languages
Post Correspondence Problem	Variations on the Post Correspondence Problem for free groups
Power-free language	Branching Frequency and Markov Entropy of Repetition-Free Languages
prefix normal words	Weighted Prefix Normal Words: Mind the Gap
prefix tree	Branching Frequency and Markov Entropy of Repetition-Free Languages
projection	State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters
Pushdown automata	Space Complexity of Stack Automata Models
R
r-shortest string	Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
random walk	Branching Frequency and Markov Entropy of Repetition-Free Languages
Rational constraint	Variations on the Post Correspondence Problem for free groups
reconstruction problem	Reconstructing Words from Right-Bounded-Block Words
Regular languages	Balanced-by-construction regular and omega-regular languages Properties of Graphs Specified by a Regular Language Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata Operations on Permutation Automata The State Complexity of Lexicographically Smallest Words and Computing Successors
Reversible computations	Reversible Top-Down Syntax Analysis
S
scattered factors	Reconstructing Words from Right-Bounded-Block Words Scattered Factor-Universality of Words
Series-parallel posets	Equational Theories of Scattered and Countable Series-parallel Posets
Shuffle on trajectories	Balanced-by-construction regular and omega-regular languages
simple grammars	The hardest LL(k) language
Space Complexity	Two-Way Non-Uniform Finite Automata Space Complexity of Stack Automata Models
Stack automata	Space Complexity of Stack Automata Models
State complexity	State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters A Study of a Simple Class of Modifiers: Product Modifiers
state-partition automata	State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters
Stateless pushdown automata	Reversible Top-Down Syntax Analysis
Sublinear time	Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
subset synchronization	Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
Subwords	Parikh Word Representable Graphs and Morphisms
Symmetry groups	Symmetry groups of infinite words
Synchronization	Extremal Binary PFAs in a Cerny Family
T
Toeplitz words	Symmetry groups of infinite words
Top-down syntax analysis	Reversible Top-Down Syntax Analysis
Top-down tree transducer	Compositions of Constant Weighted Extended Tree Transducers
Transfinite N-free posets	Equational Theories of Scattered and Countable Series-parallel Posets
Tree grammars	On Tree Substitution Grammars
tree transducer	Definability Results for Top-Down Tree Transducers
Tree transducers	Equivalence of Linear Tree Transducers with Output in the Free Group
Tree-to-Word Transducers	On the Balancedness of Tree-to-word Transducers
Turing Machine	A Linear-time Simulation of Deterministic d-Limited Automata
Two-dimensional pattern matching	Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
two-way DFA	A Linear-time Simulation of Deterministic d-Limited Automata
Two-Way Finite Automata	Two-Way Non-Uniform Finite Automata
U
unambiguous grammars	Bounded Languages Described by GF(2)-grammars
undecidability	Integer Weighted Automata on Infinite Words
uniform random generation	On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
universality problem	Integer Weighted Automata on Infinite Words
V
Variable length non-overlapping codes	A strong non-overlapping Dyck code
varieties	Deciding FO2 Alternation for Automata over Finite and Infinite Words
variety of languages	Caratheodory Extensions of Subclasses of Regular Languages
W
weakly acyclic automata	Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
weight measure	Weighted Prefix Normal Words: Mind the Gap
weighted automata	Integer Weighted Automata on Infinite Words
weighted prefix normal words	Weighted Prefix Normal Words: Mind the Gap
Weighted tree transducer	Compositions of Constant Weighted Extended Tree Transducers
word transducers	Active Learning of Sequential Transducers with Side Information about the Domain
Word-MIX Language	Context-Freeness of Word-MIX Languages
Words	Parikh Word Representable Graphs and Morphisms

Disclaimer | Powered by EasyChair Smart Program