Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th DLT 2021: Porto, Portugal
- Nelma Moreira
, Rogério Reis:
Developments in Language Theory - 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021, Proceedings. Lecture Notes in Computer Science 12811, Springer 2021, ISBN 978-3-030-81507-3
Invited Talks
- Jean-Paul Allouche:
Morphic Sequences Versus Automatic Sequences. 3-11 - Henning Fernau:
Parsimonious Computational Completeness. 12-26 - Benjamin Steinberg:
Pointlike Sets and Separation: A Personal Perspective. 27-40
Regular Papers
- Elena Barcucci, Antonio Bernini, Renzo Pinzani:
A Strong Non-overlapping Dyck Code. 43-53 - Raphaël Berthon, Adrien Boiret, Guillermo A. Pérez, Jean-François Raskin:
Active Learning of Sequential Transducers with Side Information About the Domain. 54-65 - Malte Blattmann, Andreas Maletti:
Compositions of Constant Weighted Extended Tree Transducers. 66-77 - Stijn Cambie, Michiel de Bondt, Henk Don:
Extremal Binary PFAs in a Černý Family. 78-89 - Laura Ciobanu, Alan D. Logan:
Variations on the Post Correspondence Problem for Free Groups. 90-102 - Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Reducing Local Alphabet Size in Recognizable Picture Languages. 103-116 - Volker Diekert, Henning Fernau, Petra Wolf:
Properties of Graphs Specified by a Regular Language. 117-129 - Luc Edixhoven, Sung-Shik Jongmans:
Balanced-By-Construction Regular and ømega-Regular Languages. 130-142 - Yannik Eikmeier, Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka:
Weighted Prefix Normal Words: Mind the Gap. 143-154 - Fabian Frei, Juraj Hromkovic, Richard Královic, Rastislav Královic:
Two-Way Non-uniform Finite Automata. 155-166 - Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Integer Weighted Automata on Infinite Words. 167-179 - Viktor Henriksson, Manfred Kufleitner:
Deciding FO2 Alternation for Automata over Finite and Infinite Words. 180-191 - Stefan Hoffmann:
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters. 192-203 - Stefan Hoffmann:
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata. 204-216 - Stepan Holub, Stepán Starosta:
Lyndon Words Formalized in Isabelle/HOL. 217-228 - Markus Holzer, Christian Rauch:
The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract). 229-241 - Dietrich Kuske:
Second-Order Finite Automata: Expressive Power and Simple Proofs Using Automatic Structures. 242-254 - Martin Kutrib, Uwe Meyer:
Reversible Top-Down Syntax Analysis. 255-266 - Sergey Luchinin, Svetlana Puzynina:
Symmetry Groups of Infinite Words. 267-278 - Vladislav Makarov:
Bounded Languages Described by GF(2)-grammars. 279-290 - Sebastian Maneth, Helmut Seidl, Martin Vu:
Definability Results for Top-Down Tree Transducers. 291-303 - Mikhail Mrykhin, Alexander Okhotin:
The Hardest LL(k) Language. 304-315 - Julian Pape-Lange:
Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings. 316-327 - Elena A. Petrova, Arseny M. Shur:
Branching Frequency and Markov Entropy of Repetition-Free Languages. 328-341 - Alexander A. Rubtsov:
A Linear-Time Simulation of Deterministic d-Limited Automata. 342-354 - Ryoma Sin'ya:
Carathéodory Extensions of Subclasses of Regular Languages. 355-367 - Nobin Thomas, Lisa Mathew, Somnath Bera, Atulya K. Nagar, K. G. Subramanian:
Parikh Word Representable Graphs and Morphisms. 368-379
a service of 
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 2024-04-25 05:27 CEST 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:
