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 41 matches
- 2011
- Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers:
Rule Formats for Distributivity. LATA 2011: 80-91 - Dana Angluin, James Aspnes, Raonne Barbosa Vargas:
Mutation Systems. LATA 2011: 92-104 - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Classification of String Languages via Tiling Recognizable Picture Languages. LATA 2011: 105-116 - Holger Bock Axelsen, Robert Glück:
A Simple and Efficient Universal Reversible Turing Machine. LATA 2011: 117-128 - Agata Barecka, Witold Charatonik:
The Parameterized Complexity of Chosen Problems for Finite Automata on Trees. LATA 2011: 129-141 - Martin Berglund, Henrik Björklund, Johanna Högberg:
Recognizing Shuffled Languages. LATA 2011: 142-154 - Francine Blanchet-Sadri, Kevin Black, Andrew Zemke:
Unary Pattern Avoidance in Partial Words Dense with Holes. LATA 2011: 155-166 - Robert Brijder, Hendrik Blockeel:
Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars. LATA 2011: 167-178 - Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot:
Partial Derivatives of an Extended Regular Expression. LATA 2011: 179-191 - John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan:
Automatic Learning of Subclasses of Pattern Languages. LATA 2011: 192-203 - Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit:
Finite Orbits of Language Operations. LATA 2011: 204-215 - Krishnendu Chatterjee, Nathanaël Fijalkow:
Finitary Languages. LATA 2011: 216-226 - Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn:
The Complexity of Request-Response Games. LATA 2011: 227-237 - Thomas Colcombet:
Green's Relations and Their Use in Automata Theory. LATA 2011: 1-21 - Ehud S. Conley, Shmuel Tomi Klein:
Improved Alignment Based Algorithm for Multilingual Text Compression. LATA 2011: 238-249 - Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas:
Singular Artin Monoids of Finite Coxeter Type Are Automatic. LATA 2011: 250-261 - Jürgen Dassow, Florin Manea, Bianca Truthe:
Networks of Evolutionary Processors with Subregular Filters. LATA 2011: 262-273 - Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski:
Decision Problems for Interval Markov Chains. LATA 2011: 274-285 - Marcus Gelderie:
Classifying Regular Languages via Cascade Products of Automata. LATA 2011: 286-297 - Jana Hadravová:
The Block Structure of Successor Morphisms. LATA 2011: 298-309 - Martin Huschenbett:
Models for Quantitative Distributed Systems and Multi-Valued Logics. LATA 2011: 310-322 - Christina Jansen, Jonathan Heinen, Joost-Pieter Katoen, Thomas Noll:
A Local Greibach Normal Form for Hyperedge Replacement Grammars. LATA 2011: 323-335 - Bakhadyr Khoussainov:
Automatic Structures and Groups. LATA 2011: 22-40 - Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Unique Small Subgraphs Are Not Easier to Find. LATA 2011: 336-341 - Pavel Labath, Branislav Rovan:
Simplifying DPDA Using Supplementary Information. LATA 2011: 342-353 - Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi:
Normalization of Sequential Top-Down Tree-to-Word Transducers. LATA 2011: 354-365 - Jérôme Leroux:
Vector Addition System Reachability Problem: A Short Self-contained Proof. LATA 2011: 41-64 - Alexei Lisitsa, Igor Potapov, Rafiq Saleh:
Planarity of Knots, Register Automata and LogSpace Computability. LATA 2011: 366-377 - Jacek Marciniec:
Tarski's Principle, Categorial Grammars and Learnability. LATA 2011: 378-389 - Benedek Nagy, Friedrich Otto:
Globally Deterministic CD-Systems of Stateless R(1)-Automata. LATA 2011: 390-401
skipping 11 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-30 22:02 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