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 46 matches
- 2018
- Markus Holzer
, Sebastian Jakobi, Jozef Jirásek Jr.:
Computational Complexity of Decision Problems on Self-verifying Finite Automata. DLT 2018: 404-415 - Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez:
Weak Cost Register Automata Are Still Powerful. DLT 2018: 83-95 - Nicolas Baudru, Pierre-Alain Reynier:
From Two-Way Transducers to Regular Function Expressions. DLT 2018: 96-108 - Simon Beier, Markus Holzer:
Decidability of Right One-Way Jumping Finite Automata. DLT 2018: 109-120 - Jason P. Bell, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Additive Number Theory via Approximation by Regular Languages. DLT 2018: 121-132 - Johanna Björklund:
Tree-to-Graph Transductions with Scope. DLT 2018: 133-144 - Eugenija A. Bondar, Mikhail V. Volkov:
A Characterization of Completely Reachable Automata. DLT 2018: 145-155 - Mário J. J. Branco, Jean-Éric Pin:
Inequalities for One-Step Products. DLT 2018: 156-168 - Arturo Carpi, Flavio D'Alessandro:
On the Commutative Equivalence of Context-Free Languages. DLT 2018: 169-181 - Olivier Carton, Maurice Pouzet:
Simon's Theorem for Scattered Words. DLT 2018: 182-193 - Costanza Catalano, Raphaël M. Jungers:
The Synchronizing Probability Function for Primitive Sets of Matrices. DLT 2018: 194-205 - Didier Caucal, Chloé Rispal:
Recognizability for Automata. DLT 2018: 206-218 - Da-Jung Cho, Yo-Sub Han, Hwee Kim, Kai Salomaa:
Site-Directed Deletion. DLT 2018: 219-230 - Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Counting Subwords and Regular Languages. DLT 2018: 231-242 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Deque Languages, Automata and Planar Graphs. DLT 2018: 243-255 - Sylvie Davies:
A General Approach to State Complexity of Operations: Formalization and Limitations. DLT 2018: 256-268 - Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka, Markus L. Schmid:
On Matching Generalised Repetitive Patterns. DLT 2018: 269-281 - Sebastian Eberhard, Gabriel Ebner, Stefan Hetzl:
Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars. DLT 2018: 291-303 - Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
A Pattern Logic for Automata with Outputs. DLT 2018: 304-317 - Lukas Fleischer:
The Intersection Problem for Finite Semigroups. DLT 2018: 318-329 - Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
Block Sorting-Based Transformations on Words: Beyond the Magic BWT. DLT 2018: 1-17 - François Gonze, Raphaël M. Jungers:
On Completely Reachable Automata and Subset Reachability. DLT 2018: 330-341 - Hermann Gruber, Markus Holzer, Simon Wolfsteiner:
On Minimal Grammar Problems for Finite Languages. DLT 2018: 342-353 - Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero:
Reversible Pushdown Transducers. DLT 2018: 354-365 - Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. DLT 2018: 366-378 - Vladimir V. Gusev, Raphaël M. Jungers, Daniel Prusa:
Dynamics of the Independence Number and Automata Synchronization. DLT 2018: 379-391 - Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Closest Substring Problems for Regular Languages. DLT 2018: 392-403 - Tomohiro I:
The Runs Theorem and Beyond. DLT 2018: 18-23 - Oscar H. Ibarra, Ian McQuillan:
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. DLT 2018: 416-428 - Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar:
On Counting Functions of Languages. DLT 2018: 429-440
skipping 16 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-22 17:34 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:
