Остановите войну!
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 32 matches
- 2013
- Houda Abbad, Éric Laugerotte:
Computing Weights. CIAA 2013: 24-35 - Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, Benjamin J. Wyatt:
Partial Word DFAs. CIAA 2013: 36-47 - Fevzi Belli, Mutlu Beyazit:
Using Regular Grammars for Event-Based Testing. CIAA 2013: 48-59 - Janusz A. Brzozowski, David Liu:
Universal Witnesses for State Complexity of Basic Operations Combined with Reversal. CIAA 2013: 72-83 - Cezar Câmpeanu:
Cover Languages and Implementations. CIAA 2013: 1 - Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot:
Trimming Visibly Pushdown Automata. CIAA 2013: 84-96 - Dmitry Chistikov, Rupak Majumdar:
A Uniformization Theorem for Nested Word to Word Transductions. CIAA 2013: 97-108 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Deterministic Counter Machines and Parallel Matching Computations. CIAA 2013: 280-291 - Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui:
Early Nested Word Automata for XPath Query Answering on XML Streams. CIAA 2013: 292-305 - Pierpaolo Degano, Gian-Luigi Ferrari, Gianluca Mezzetti:
Towards Nominal Context-Free Model-Checking. CIAA 2013: 109-121 - Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Jacques Sakarovitch:
Implementation Concepts in Vaucanson 2. CIAA 2013: 122-133 - Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko:
Enhancing Approximations for Regular Reachability Analysis. CIAA 2013: 331-339 - Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat:
A Completion Algorithm for Lattice Tree Automata. CIAA 2013: 134-145 - Niels Bjørn Bugge Grathwohl, Fritz Henglein, Lasse Nielsen, Ulrik Terp Rasmussen:
Two-Pass Greedy Regular Expression Parsing. CIAA 2013: 60-71 - Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton. CIAA 2013: 146-157 - Md. Mahbubul Hasan, A. S. M. Sohidull Islam, M. Sohel Rahman, Ayon Sen:
On Palindromic Sequence Automata and Applications. CIAA 2013: 158-168 - Patrick Henry, Géraud Sénizergues:
LALBLC A Program Testing the Equivalence of dpda's. CIAA 2013: 169-180 - Markus Holzer, Sebastian Jakobi:
Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract). CIAA 2013: 181-192 - Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Automata for Dictionary Matching. CIAA 2013: 319-330 - Oscar H. Ibarra, Bala Ravikumar:
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages. CIAA 2013: 193-207 - Jozef Jirásek, Galina Jirásková:
On the Boundary of Regular Languages. CIAA 2013: 208-219 - Helmut Jürgensen:
Automata for Codes. CIAA 2013: 2-15 - Andrzej Kisielewicz, Marek Szykula:
Generating Small Automata and the Černý Conjecture. CIAA 2013: 340-348 - Natalia Kushik, Nina Yevtushenko:
On the Length of Homing Sequences for Nondeterministic Finite State Machines. CIAA 2013: 220-231 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt:
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA 2013: 232-243 - Eva Maia, Nelma Moreira, Rogério Reis:
Incomplete Transition Complexity of Basic Operations on Finite Languages. CIAA 2013: 349-356 - Andreas Maletti:
Hyper-optimization for Deterministic Tree Automata. CIAA 2013: 244-255 - Frantisek Mráz, Friedrich Otto:
Lambda-Confluence Is Undecidable for Clearing Restarting Automata. CIAA 2013: 256-267 - Daniel Prusa, Frantisek Mráz, Friedrich Otto:
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata. CIAA 2013: 268-279 - Klaus Sutner:
Invertible Transducers, Iteration and Coordinates. CIAA 2013: 306-318
skipping 2 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-04-25 08:14 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