Остановите войну!
for scientists:
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 756 matches
- 2023
- Samira Attou, Ludovic Mignot, Clément Miklarz, Florent Nicart:
Constrained Multi-Tildes. CIAA 2023: 66-78 - Václav Blazej, Jan Janousek, Stepán Plachý:
On the Smallest Synchronizing Terms of Finite Tree Automata. CIAA 2023: 79-90 - Bernard Boigelot, Pascal Fontaine, Baptiste Vergain:
Universal First-Order Quantification over Automata. CIAA 2023: 91-102 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions. CIAA 2023: 103-115 - Szilárd Zsolt Fazekas, Robert Mercas:
Sweep Complexity Revisited. CIAA 2023: 116-127 - Viliam Geffert:
Binary Coded Unary Regular Languages. CIAA 2023: 3-20 - Hermann Gruber, Markus Holzer, Christian Rauch:
The Pumping Lemma for Regular Languages is Hard. CIAA 2023: 128-140 - Joonghyuk Hahn, Hyunjoon Cheon, Yo-Sub Han:
M-equivalence of Parikh Matrix over a Ternary Alphabet. CIAA 2023: 141-152 - Michal Hospodár, Galina Jirásková:
Operational Complexity in Subregular Classes. CIAA 2023: 153-165 - Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki:
When Is Context-Freeness Distinguishable from Regularity? an Extension of Parikh's Theorem. CIAA 2023: 166-178 - Shmuel T. Klein, Dana Shapira:
Enhanced Ternary Fibonacci Codes. CIAA 2023: 179-193 - Martin Kutrib:
Sweeping Input-Driven Pushdown Automata. CIAA 2023: 194-205 - Kevin Lotz, Mitja Kulczynski, Dirk Nowotka, Danny Bøgsted Poulsen, Anders Schlichtkrull:
Verified Verifying: SMT-LIB for Strings in Isabelle. CIAA 2023: 206-217 - Andreas Maletti, Andreea-Teodora Nász:
Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable. CIAA 2023: 218-229 - Sebastian Maneth, Martin Vu:
Deciding Whether an Attributed Translation Can Be Realized by a Top-Down Transducer. CIAA 2023: 230-241 - Olga Martynova, Alexander Okhotin:
A Time to Cast Away Stones. CIAA 2023: 242-253 - Friedrich Otto:
A Survey on Automata with Translucent Letters. CIAA 2023: 21-50 - Giovanni Pighizzini, Luca Prigioniero:
Two-Way Machines and de Bruijn Words. CIAA 2023: 254-265 - Antonio Al Serhali, Joachim Niehren:
Earliest Query Answering for Deterministic Stepwise Hedge Automata. CIAA 2023: 53-65 - Jeffrey O. Shallit, Anatoly Zavyalov:
Transduction of Automatic Sequences and Applications. CIAA 2023: 266-277 - Ryoma Sin'ya:
Measuring Power of Generalised Definite Languages. CIAA 2023: 278-289 - Sicheol Sung, Sang-Ki Ko, Yo-Sub Han:
Smaller Representation of Compiled Regular Expressions. CIAA 2023: 290-301 - Benedek Nagy:
Implementation and Application of Automata - 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023, Proceedings. Lecture Notes in Computer Science 14151, Springer 2023, ISBN 978-3-031-40246-3 [contents] - 2022
- Florian Bruse, Maurice Herwig, Martin Lange:
A Similarity Measure for Formal Languages Based on Convergent Geometric Series. CIAA 2022: 80-92 - Özdeniz Dolu, Nevzat Ersoy, M. Utkan Gezer, A. C. Cem Say:
Real-Time, Constant-Space, Constant-Randomness Verifiers. CIAA 2022: 212-224 - Frank Drewes, Richard Mörbitz, Heiko Vogler:
Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata. CIAA 2022: 93-105 - Hermann Gruber, Markus Holzer, Christian Rauch:
On 25 Years of CIAA Through the Lens of Data Science. CIAA 2022: 3-18 - Stefan Hoffmann:
Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents. CIAA 2022: 225-237 - Michal Hospodár, Viktor Olejár:
The Cut Operation in Subclasses of Convex Languages (Extended Abstract). CIAA 2022: 152-164 - Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach:
A Toolkit for Parikh Matrices. CIAA 2022: 116-127
skipping 726 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-09-05 02:36 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