-
Viliam Geffert, Zuzana Bednarova and Alexander Szabari
-
Input-Driven Pushdown Automata for Edit Distance Neighborhood
-
Marie Lejeune, Julien Leroy and Michel Rigo
-
Computing the k-binomial complexity of the Thue-Morse word
-
Paolo Massazza
-
Hole-free Partially Directed Animals
-
Umer Azfar, Costanza Catalano, Ludovic Charlier and Raphaël Jungers
-
A linear bound on the k-rendezvous time for primitive sets of NZ matrices
-
Massimiliano Goldwurm, Jianyi Lin
and Marco Vignati
-
Analysis of symbol statistics in bicomponent rational models
-
Denis Kuperberg, Laureline Pinault and Damien Pous
-
Coinductive algorithms for Büchi automata
-
Simon Iosti and Denis Kuperberg
-
Eventually Safe Languages
-
Aleksi Saarela
-
Separating many words by counting occurrences of factors
-
Egor Dobronravov, Nikita Dobronravov and Alexander Okhotin
-
On the length of shortest strings accepted by two-way finite automata
-
Di-De Yen and Hsu-Chun Yen
-
Characterizing the Valuedness of Two-way Finite Transducers
-
Joel Day, Pamela Fleischmann, Florin Manea
and Dirk Nowotka
-
k-Spectra of c-Balanced Words
-
Tara Brough, Alan Cain and Markus Pfeiffer
-
Context-free word problem semigroups
-
Friedrich Otto and František Mráz
-
On Shrinking Restarting Automata of Window Size One and Two
-
Jarkko Kari, Andrew Ryzhikov and Anton Varonka
-
Words of Minimum Rank in Deterministic Finite Automata
-
Paul Gastin, Amaldev Manuel and Govind R
-
Logics for Reversible Regular Languages and Semigroups with Involution
-
Anna Frid
-
First lower bounds on palindromic length
-
Hyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko
and Kai Salomaa
-
The Relative Edit-Distance Between Two Input-Driven Languages
-
Petr Ambroz and Edita Pelantová
-
On palindromic length of Sturmian sequences
-
Ziyuan Gao.
-
The Teaching Complexity of Erasing Pattern Languages With Bounded Variable Frequency
-
Ramchandra Phawade, Krishna S, Ashutosh Trivedi
and Devendra Bhave
-
On timed scope-bounded context-sensitive languages