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 45 matches
- 2008
- Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Yurii Rogozhin:
About Universal Hybrid Networks of Evolutionary Processors of Small Size. LATA 2008: 28-39 - Jan-Henrik Altenbernd:
On Bifix Systems and Generalizations. LATA 2008: 40-51 - Terry Anderson, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Finite Automata, Palindromes, Powers, and Patterns. LATA 2008: 52-63 - Pablo Arrighi, Vincent Nesme, Reinhard F. Werner:
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations. LATA 2008: 64-75 - Dorothea Baumeister, Jörg Rothe:
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. LATA 2008: 76-87 - Denis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel:
Optional and Iterated Types for Pregroup Grammars. LATA 2008: 88-100 - Florent Becker:
Transformations and Preservation of Self-assembly Dynamics through Homotheties. LATA 2008: 101-112 - Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib:
Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA 2008: 113-124 - Mikolaj Bojanczyk:
Tree-Walking Automata. LATA 2008: 1-2 - Henning Bordihn, Markus Holzer:
Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. LATA 2008: 125-136 - Robert Brijder, Hendrik Jan Hoogeboom:
Extending the Overlap Graph for Gene Assembly in Ciliates. LATA 2008: 137-148 - Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas:
Automatic Presentations for Cancellative Semigroups. LATA 2008: 149-159 - Silvio Capobianco:
Induced Subshifts and Cellular Automata. LATA 2008: 160-171 - Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
Hopcroft's Algorithm and Cyclic Automata. LATA 2008: 172-183 - Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren:
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. LATA 2008: 184-195 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Consensual Definition of Languages by Regular Sets. LATA 2008: 196-208 - Jürgen Dassow, Sherzod Turaev:
k-Petri Net Controlled Grammars. LATA 2008: 209-220 - Michael Domaratzki:
Formal Language Tools for Template-Guided DNA Recombination. LATA 2008: 3-5 - Pawel Gawrychowski, Andrzej Kisielewicz:
2-Synchronizing Words. LATA 2008: 221-231 - Mathieu Giraud:
Not So Many Runs in Strings. LATA 2008: 232-239 - Ozan Kahramanogullari:
On Linear Logic Planning and Concurrency. LATA 2008: 250-262 - Laura Kallmeyer, Yannick Parmentier:
On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG). LATA 2008: 263-274 - Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau:
Anti-pattern Matching Modulo. LATA 2008: 275-286 - Sergey Kitaev, Toufik Mansour, Patrice Séébold:
Counting Ordered Patterns in Words Generated by Morphisms. LATA 2008: 287-298 - Ondrej Klíma, Libor Polák:
Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups. LATA 2008: 299-310 - Barbara Klunder:
Characterization of Star-Connected Languages Using Finite Automata. LATA 2008: 311-320 - Martin Korp, Aart Middeldorp:
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. LATA 2008: 321-332 - Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
Further Results on Insertion-Deletion Systems with One-Sided Contexts. LATA 2008: 333-344 - Peter Leupold:
On Regularity-Preservation by String-Rewriting Systems. LATA 2008: 345-356 - Andreas Maletti:
Minimizing Deterministic Weighted Tree Automata. LATA 2008: 357-372
skipping 15 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-11-14 22:24 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