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