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 26 matches
- 2024
- Eugene Asarin
, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán:
Computing the Bandwidth of Meager Timed Automata. CIAA 2024: 19-34 - Aaron Barnoff, Curtis Bright, Jeffrey O. Shallit:
Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals. CIAA 2024: 35-50 - Robert Baumgartner, Sicco Verwer:
PDFA Distillation with Error Bound Guarantees. CIAA 2024: 51-65 - Martin Berglund, Willeke Martens, Brink van der Merwe:
Constructing a BPE Tokenization DFA. CIAA 2024: 66-78 - Yohan Boichut, Vincent Hugot, Adrien Boiret:
SAT-Based Automated Completion for Reachability Analysis. CIAA 2024: 79-93 - Bernard Boigelot, Pascal Fontaine, Baptiste Vergain:
Non-emptiness Test for Automata over Words Indexed by the Reals and Rationals. CIAA 2024: 94-108 - Simon Dieck, Sicco Verwer:
On Bidirectional Deterministic Finite Automata. CIAA 2024: 109-123 - Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis:
Block Languages and Their Bitmap Representations. CIAA 2024: 124-137 - Attila Egri-Nagy, Chrystopher L. Nehaniv:
From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups. CIAA 2024: 138-152 - Hermann Gruber, Markus Holzer, Christian Rauch:
On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract). CIAA 2024: 153-165 - Luisa Herrmann, Richard Mörbitz:
Global One-Counter Tree Automata. CIAA 2024: 166-179 - Michal Hospodár, Viktor Olejár, Juraj Sebej:
Decision Problems for Subregular Classes. CIAA 2024: 180-194 - Jozef Jirásek, Galina Jirásková, Jeffrey O. Shallit:
State Complexity of the Minimal Star Basis. CIAA 2024: 195-207 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt:
On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. CIAA 2024: 208-220 - Sebastian Maneth, Martin Vu:
Attributed Tree Transducers for Partial Functions. CIAA 2024: 221-233 - Antoine Martin, Etienne Renault, Alexandre Duret-Lutz:
Translation of Semi-extended Regular Expressions Using Derivatives. CIAA 2024: 234-248 - Olga Martynova:
Exact Descriptional Complexity of Determinization of Input-Driven Pushdown Automata. CIAA 2024: 249-260 - Keisuke Nakano, Munehiro Iwami:
Disproving Termination of Non-erasing Sole Combinatory Calculus with Tree Automata. CIAA 2024: 261-275 - Dirk Nowotka, Max Wiedenhöft:
The Equivalence Problem of E-Pattern Languages with Regular Constraints Is Undecidable. CIAA 2024: 276-288 - Giovanni Pighizzini:
Push Complexity: Optimal Bounds and Unary Inputs. CIAA 2024: 289-301 - Maria Radionova, Alexander Okhotin:
Decision Problems for Reversible and Permutation Automata. CIAA 2024: 302-315 - Alexander Roodt, Brendan Keith Mark Watling, Willem Bester, Brink van der Merwe, Sicheol Sung, Yo-Sub Han:
Benchmarking Regular Expression Matching. CIAA 2024: 316-331 - Hiroyuki Seki:
Automata and Grammars for Data Words. CIAA 2024: 3-16 - Tianxiang Tang, Vladimir A. Zakharov:
On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers. CIAA 2024: 332-346 - Takao Yuyama, Ryoma Sin'ya:
Measuring Power of Commutative Group Languages. CIAA 2024: 347-362 - Szilárd Zsolt Fazekas:
Implementation and Application of Automata - 28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024, Proceedings. Lecture Notes in Computer Science 15015, Springer 2024, ISBN 978-3-031-71111-4 [contents]
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 2025-01-26 02:54 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:
