default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th DLT 2022: Tampa, FL, USA
- Volker Diekert
, Mikhail V. Volkov:
Developments in Language Theory - 26th International Conference, DLT 2022, Tampa, FL, USA, May 9-13, 2022, Proceedings. Lecture Notes in Computer Science 13257, Springer 2022, ISBN 978-3-031-05577-5
Invited Talks
- Paola Bonizzoni, Clelia De Felice, Yuri Pirola, Raffaella Rizzi, Rocco Zaccagnino, Rosalba Zizza:
Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes? 3-12 - Joel D. Day:
Word Equations in the Context of String Solving. 13-32 - Giovanni Di Crescenzo, Matluba Khodjaeva, Delaram Kahrobaei, Vladimir Shpilrain:
A Survey on Delegated Computation. 33-53
Regular Papers
- C. Aiswarya, Sahil Mhaskar, M. Praveen:
Checking Regular Invariance Under Tightly-Controlled String Modifications. 57-68 - Aistis Atminas, Vadim V. Lozin:
Deciding Atomicity of Subword-Closed Languages. 69-77 - Dora V. Bulgakova, Anna E. Frid, Jérémy Scanvic:
Prefix Palindromic Length of the Sierpinski Word. 78-89 - Olivier Carton:
Preservation of Normality by Unambiguous Transducers. 90-101 - Émilie Charlier, Célia Cisternino, Manon Stipulanti:
A Full Characterization of Bertrand Numeration Systems. 102-114 - Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han:
On the Decidability of Infix Inclusion Problem. 115-126 - Francesco Dolce, Pierre-Adrien Tahay:
Column Representation of Sturmian Words in Cellular Automata. 127-138 - Andrea Frosini, Ilaria Mancini, Simone Rinaldi, Giuseppe Romana, Marinella Sciortino:
Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words. 139-151 - Elias Heikkilä, Pyry Herva, Jarkko Kari:
On Perfect Coverings of Two-Dimensional Grids. 152-163 - Stefan Hoffmann:
Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages. 164-176 - Oscar H. Ibarra, Ian McQuillan:
On the Complexity of Decision Problems for Counter Machines with Applications to Coding Theory. 177-188 - Jozef Jirásek, Ian McQuillan:
Visit-Bounded Stack Automata. 189-200 - Ondrej Klíma, Jonatan Kolegar:
Well Quasi-Orders Arising from Finite Ordered Semigroups. 201-212 - Szymon Lopaciuk, Daniel Reidenbach:
The Billaud Conjecture for ${|{\varSigma } |} = 4$, and Beyond. 213-225 - Andreas Maletti, Andreea-Teodora Nász:
Weighted Tree Automata with Constraints. 226-238 - Giovanni Pighizzini, Luca Prigioniero, Simon Sádovský:
Performing Regular Operations with 1-Limited Automata. 239-250 - Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
Binomial Complexities and Parikh-Collinear Morphisms. 251-262 - Ekaterina N. Shemetova, Alexander Okhotin, Semyon V. Grigorev:
Rational Index of Languages with Bounded Dimension of Parse Trees. 263-273 - Ryoma Sin'ya:
Measuring Power of Locally Testable Languages. 274-285 - Florian Stober, Armin Weiß:
The Power Word Problem in Graph Products. 286-298 - Zoran Sunic:
On One-Counter Positive Cones of Free Groups. 299-311 - Tomoyuki Yamakami:
Kolmogorov Complexity Descriptions of the Exquisite Behaviors of Advised Deterministic Pushdown Automata. 312-324
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-21 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
