


default search action
27th DLT 2023: Umeå, Sweden
- Frank Drewes

, Mikhail Volkov
:
Developments in Language Theory - 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023, Proceedings. Lecture Notes in Computer Science 13911, Springer 2023, ISBN 978-3-031-33263-0 - William Merrill:

Formal Languages and the NLP Black Box. 1-8 - Shaull Almagor

, Omer Yizhaq:
Jumping Automata over Infinite Words. 9-22 - Marcella Anselmo, Giuseppa Castiglione, Manuela Flores

, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Isometric Words Based on Swap and Mismatch Distance. 23-35 - Ansuman Banerjee, Kingshuk Chatterjee, Shibashis Guha:

Set Augmented Finite Automata over Infinite Alphabets. 36-50 - Marie-Pierre Béal

, Maxime Crochemore
:
Fast Detection of Specific Fragments Against a Set of Sequences. 51-60 - Hyunjoon Cheon

, Yo-Sub Han:
Weak Inverse Neighborhoods of Languages. 61-73 - Pascal Caron, Alexandre Durand, Bruno Patrou:

The Exact State Complexity for the Composition of Root and Reversal. 74-85 - Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana

, Marinella Sciortino, Cristian Urbina
:
Bit Catastrophes for the Burrows-Wheeler Transform. 86-99 - Benjamin Hellouin de Menibus

, Victor H. Lutfalla
, Camille Noûs:
The Domino Problem Is Undecidable on Every Rhombus Subshift. 100-112 - Stefan Hoffmann

:
Synchronization of Parikh Automata. 113-127 - Stefan Hoffmann

:
Completely Distinguishable Automata and the Set of Synchronizing Words. 128-142 - Christopher Hugenroth:

Zielonka DAG Acceptance and Regular Languages over Infinite Words. 143-155 - Benny George Kenkireth, Ahaan Sameer Malhotra:

On Word-Representable and Multi-word-Representable Graphs. 156-167 - Sungmin Kim

, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
On the Simon's Congruence Neighborhood of Languages. 168-181 - Martin Kutrib

, Uwe Meyer
:
Tree-Walking-Storage Automata. 182-194 - Zuzana Masáková, Edita Pelantová, Katarína Studenicová

:
Rewriting Rules for Arithmetics in Alternate Base Systems. 195-207 - Jakub Ruszil

:
Synchronizing Automata with Coinciding Cycles. 208-218 - Arseny M. Shur:

Approaching Repetition Thresholds via Local Resampling and Entropy Compression. 219-232 - Sam M. Thompson, Dominik D. Freydenberger:

Languages Generated by Conjunctive Query Fragments of FC[REG]. 233-245 - Takao Yuyama:

Groups Whose Word Problems Are Accepted by Abelian G-Automata. 246-257

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














