default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 1,045 matches
- 2024
- C. Aiswarya
, Amaldev Manuel
Deciding Conjugacy of a Rational Relation - (Extended Abstract). DLT 2024: 37-50 - Amazigh Amrane, Hugo Bazille, Uli Fahrenberg, Marie Fortin:
Logic and Languages of Higher-Dimensional Automata. DLT 2024: 51-67 - Ingyu Baek, Joonghyuk Hahn, Yo-Sub Han, Kai Salomaa:
Universal Rewriting Rules for the Parikh Matrix Injectivity Problem. DLT 2024: 68-81 - Marco B. Caminati
O2 is a Multiple Context-Free Grammar: An Implementation-, Formalisation-Friendly Proof. DLT 2024: 82-97 - Michele Chiari
Cyclic Operator Precedence Grammars for Improved Parallel Parsing. DLT 2024: 98-113 - Ferdinando Cicalese
On the Complexity and Approximability of Bounded Access Lempel Ziv Coding. DLT 2024: 114-130 - Laura Ciobanu
Word Equations, Constraints, and Formal Languages. DLT 2024: 1-12 - Travis Gagie
How to Find Long Maximal Exact Matches and Ignore Short Ones. DLT 2024: 131-140 - Hermann Gruber, Markus Holzer, Christian Rauch:
The Pumping Lemma for Context-Free Languages is Undecidable. DLT 2024: 141-155 - Oscar H. Ibarra, Ian McQuillan:
Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors. DLT 2024: 156-172 - Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki:
Semidirect Product Decompositions for Periodic Regular Languages. DLT 2024: 173-188 - Sandra Kiefer
Polyregular Functions: Characterisations and Refutations. DLT 2024: 13-21 - Sungmin Kim, Yo-Sub Han:
Approximate Cartesian Tree Pattern Matching. DLT 2024: 189-202 - Martin Kutrib
Cellular Automata: From Black-and-White to High Gloss Color. DLT 2024: 22-36 - Martin Kutrib
Deterministic Pushdown Automata with Translucent Input Letters. DLT 2024: 203-217 - Philomena Moek
Network Topologies for Parallel Communicating Finite Automata: Token-Ring and Token-Bus. DLT 2024: 218-235 - Benedek Nagy, Friedrich Otto:
Finite Automata with Sets of Translucent Words. DLT 2024: 236-251 - Jakub Ruszil:
Careful Synchronization of One-Cluster Automata. DLT 2024: 252-265 - Marco Sälzer
Verifying and Interpreting Neural Networks Using Finite Automata. DLT 2024: 266-281 - Yinfeng Zhu
Around Don's Conjecture for Binary Completely Reachable Automata. DLT 2024: 282-295 - Joel D. Day
Developments in Language Theory - 28th International Conference, DLT 2024, Göttingen, Germany, August 12-16, 2024, Proceedings. Lecture Notes in Computer Science 14791, Springer 2024, ISBN 978-3-031-66158-7 [contents] - 2023
- Stefan Hoffmann
Synchronization of Parikh Automata. DLT 2023: 113-127 - Stefan Hoffmann
Completely Distinguishable Automata and the Set of Synchronizing Words. DLT 2023: 128-142 - Shaull Almagor
Jumping Automata over Infinite Words. DLT 2023: 9-22 - Marcella Anselmo, Giuseppa Castiglione, Manuela Flores
Isometric Words Based on Swap and Mismatch Distance. DLT 2023: 23-35 - Ansuman Banerjee, Kingshuk Chatterjee, Shibashis Guha:
Set Augmented Finite Automata over Infinite Alphabets. DLT 2023: 36-50 - Marie-Pierre Béal
Fast Detection of Specific Fragments Against a Set of Sequences. DLT 2023: 51-60 - Pascal Caron, Alexandre Durand, Bruno Patrou:
The Exact State Complexity for the Composition of Root and Reversal. DLT 2023: 74-85 - Hyunjoon Cheon, Yo-Sub Han:
Weak Inverse Neighborhoods of Languages. DLT 2023: 61-73 - Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana
Bit Catastrophes for the Burrows-Wheeler Transform. DLT 2023: 86-99
skipping 1,015 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-12-18 21:37 CET from data curated 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: