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 488 matches
- 2023
- Stefan Hoffmann:
State Complexity Bounds for the Commutative Closure of Group Languages. J. Autom. Lang. Comb. 28(1-3): 27-57 (2023) - Ravid Alon, Orna Kupferman:
Mutually Accepting Capacitated Automata. J. Autom. Lang. Comb. 28(1-3): 5-25 (2023) - Galina Jirásková, Giovanni Pighizzini:
Preface. J. Autom. Lang. Comb. 28(1-3): 3-4 (2023) - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. J. Autom. Lang. Comb. 28(1-3): 59-88 (2023) - Pierre Marcus, Ilkka Törmä:
Winning Sets of Regular Languages: Descriptional and Computational Complexity. J. Autom. Lang. Comb. 28(1-3): 89-120 (2023) - Alexander Okhotin, Elizaveta Sazhneva:
State Complexity of GF(2)-Inverse and GF(2)-Star on Binary Languages. J. Autom. Lang. Comb. 28(1-3): 121-141 (2023) - Daniel Prusa:
Two-Dimensional Rank-Reducing Grammars and Their Complexity. J. Autom. Lang. Comb. 28(1-3): 143-166 (2023) - Victor L. Selivanov:
Wadge Degrees of Classes of ω-Regular k-Partitions. J. Autom. Lang. Comb. 28(1-3): 167-199 (2023) - Taylor J. Smith, Kai Salomaa:
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata. J. Autom. Lang. Comb. 28(1-3): 201-220 (2023) - Martin Vu, Henning Fernau:
Insertion-Deletion with Substitutions II: About the Role of One-Sided Context. J. Autom. Lang. Comb. 28(1-3): 221-244 (2023) - Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Hypercubes and Isometric Words Based on Swap and Mismatch Distance. DCFS 2023: 21-35 - Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
Operational State Complexity Revisited: The Contribution of Monsters and Modifiers. DCFS 2023: 1-20 - Michael C. Chavrimootoo:
Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle. DCFS 2023: 36-50 - Yo-Sub Han, Sungmin Kim, Sang-Ki Ko, Kai Salomaa:
Existential and Universal Width of Alternating Finite Automata. DCFS 2023: 51-64 - Markus Holzer, Christian Rauch:
On Jaffe's Pumping Lemma, Revisited. DCFS 2023: 65-78 - Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej:
Operational Complexity: NFA-to-DFA Trade-Off. DCFS 2023: 79-93 - Maximilian Kotowsky, Jan Philipp Wächter:
The Word Problem for Finitary Automaton Groups. DCFS 2023: 94-108 - Neha Kuntewar, S. K. M. Anoop, Jayalal Sarma:
Separating Words Problem over Groups. DCFS 2023: 109-120 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Complexity of Exclusive Nondeterministic Finite Automata. DCFS 2023: 121-133 - Olga Martynova, Alexander Okhotin:
Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2n Lower Bound. DCFS 2023: 134-145 - Giovanni Pighizzini, Luca Prigioniero:
Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage. DCFS 2023: 146-157 - Josef Rukavicka:
Construction of a Bi-infinite Power Free Word with a Given Factor and a Non-recurrent Letter. DCFS 2023: 158-168 - Bianca Truthe:
Merging Two Hierarchies of External Contextual Grammars with Subregular Selection. DCFS 2023: 169-180 - Jean Weight, Trienko L. Grobler, Lynette van Zijl, Carlyle Stewart:
A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words. DCFS 2023: 181-196 - Henning Bordihn, Nicholas Q. Tran, György Vaszil:
Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings. Lecture Notes in Computer Science 13918, Springer 2023, ISBN 978-3-031-34325-4 [contents] - 2022
- Duncan Adamson:
Ranking Binary Unlabelled Necklaces in Polynomial Time. DCFS 2022: 15-29 - Stefano Crespi-Reghizzi:
The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages. DCFS 2022: 1-14 - Jérôme Durand-Lose:
On the Power of Recursive Word-Functions Without Concatenation. DCFS 2022: 30-42 - Szilárd Zsolt Fazekas, Robert Mercas:
Clusters of Repetition Roots Forming Prefix Chains. DCFS 2022: 43-56 - Pamela Fleischmann, Lukas Haschke, Annika Huch, Annika Mayrock, Dirk Nowotka:
Nearly k-Universal Words - Investigating a Part of Simon's Congruence. DCFS 2022: 57-71
skipping 458 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-10-05 12:08 CEST 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