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 34 matches
- 2012
- Cyril Allauzen, Michael Riley:
A Pushdown Transducer Extension for the OpenFst Library. CIAA 2012: 66-77 - Ahmed Amarni, Sylvain Lombardy:
Factor and Subsequence Kernels and Signatures of Rational Languages. CIAA 2012: 313-320 - Joshua Amavi, Jacques Chabin, Pierre Réty:
Weak Inclusion for Recursive XML Types. CIAA 2012: 78-89 - Mikhail V. Berlinkov
:
Synchronizing Automata on Quasi-Eulerian Digraph. CIAA 2012: 90-100 - Janusz A. Brzozowski:
In Search of Most Complex Regular Languages. CIAA 2012: 5-24 - Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot:
Multi-Tilde-Bar Derivatives. CIAA 2012: 321-328 - Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Zoran Sunic:
Cellular Automata on Regular Rooted Trees. CIAA 2012: 101-112 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Strict Local Testability with Consensus Equals Regularity. CIAA 2012: 113-124 - Pierpaolo Degano, Gian-Luigi Ferrari, Gianluca Mezzetti:
Nominal Automata for Resource Usage Control. CIAA 2012: 125-137 - Manfred Droste, Bundit Pibaljommee:
Weighted Nested Word Automata and Logics over Strong Bimonoids. CIAA 2012: 138-148 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
A Formal Framework for Processes Inspired by the Functioning of Living Cells. CIAA 2012: 25-27 - Simone Faro, Thierry Lecroq:
A Fast Suffix Automata Based Algorithm for Exact Online String Matching. CIAA 2012: 149-158 - Fedor M. Fominykh, Mikhail V. Volkov:
P(l)aying for Synchronization. CIAA 2012: 159-170 - Yuan Gao, Kai Salomaa:
In Memoriam Sheng Yu. CIAA 2012: 1-4 - Paul Gastin, Benjamin Monmege:
Adding Pebbles to Weighted Automata. CIAA 2012: 28-51 - Daniel Goc, Dane Henshall, Jeffrey O. Shallit:
Automatic Theorem-Proving in Combinatorics on Words. CIAA 2012: 180-191 - Vladimir V. Gusev:
Synchronizing Automata of Bounded Rank. CIAA 2012: 171-179 - Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
On Positive TAGED with a Bounded Number of Constraints. CIAA 2012: 329-336 - Oscar H. Ibarra, Nicholas Q. Trân:
How to Synchronize the Heads of a Multitape Automaton. CIAA 2012: 192-204 - Franz Jahn, Manfred Kufleitner, Alexander Lauser:
Regular Ideal Languages and Their Boolean Combinations. CIAA 2012: 205-216 - Artur Jez, Andreas Maletti:
Hyper-minimization for Deterministic Tree Automata. CIAA 2012: 217-228 - Galina Jirásková, Tomás Masopust:
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. CIAA 2012: 229-239 - Ines Klimann, Jean Mairesse, Matthieu Picantin:
Implementing Computations in Automaton (Semi)groups. CIAA 2012: 240-252 - Martin Kutrib, Friedrich Otto:
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata. CIAA 2012: 253-264 - Tingwen Liu, Yong Sun, Li Guo, Binxing Fang:
SDFA: Series DFA for Memory-Efficient Regular Expression Matching. CIAA 2012: 337-344 - Sylvain Lombardy, Jacques Sakarovitch:
The Removal of Weighted ε-Transitions. CIAA 2012: 345-352 - Eleni Mandrali:
Weighted LTL with Discounting. CIAA 2012: 353-360 - Pavel V. Martyugin:
Synchronization of Automata with One Undefined or Ambiguous Transition. CIAA 2012: 278-288 - Mehryar Mohri:
A Disambiguation Algorithm for Finite Automata and Functional Transducers. CIAA 2012: 265-277 - José Nuno Oliveira:
Typed Linear Algebra for Weigthed (Probabilistic) Automata. CIAA 2012: 52-65
skipping 4 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-25 13:28 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:
