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 35 matches
- 2002
- Werner Kuich, Grzegorz Rozenberg, Arto Salomaa:
Developments in Language Theory, 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001, Revised Papers. Lecture Notes in Computer Science 2295, Springer 2002, ISBN 3-540-43453-4 [contents] - 2001
- Dimitry S. Ananichev, Mikhail V. Volkov:
Collapsing Words vs. Synchronizing Words. Developments in Language Theory 2001: 166-174 - Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto:
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. Developments in Language Theory 2001: 340-348 - Thierry Cachat:
The Power of One-Letter Rational Languages. Developments in Language Theory 2001: 145-154 - Cristian Calude, Elena Calude:
Automata: From Uncertainty to Quantum. Developments in Language Theory 2001: 1-14 - Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi:
Shuffle Quotient and Decompositions. Developments in Language Theory 2001: 186-196 - Christian Choffrut:
Elementary Theory of Ordinals with Addition and Left Translation by omega. Developments in Language Theory 2001: 15-20 - Erzsébet Csuhaj-Varjú, György Vaszil:
Parallel Communicating Grammar Systems with Incomplete Information Communication. Developments in Language Theory 2001: 359-368 - Karel Culík II, Juhani Karhumäki, Jarkko Kari:
A Note on Synchronized Automata and Road Coloring Problem. Developments in Language Theory 2001: 175-185 - Michael Domaratzki, Jeffrey O. Shallit, Sheng Yu:
Minimal Covers of Formal Languages. Developments in Language Theory 2001: 319-329 - Thomas Eiter, Georg Gottlob, Thomas Schwentick:
Second-Order Logic over Strings: Regular and Non-regular Fragments. Developments in Language Theory 2001: 37-56 - Joost Engelfriet, Sebastian Maneth:
Hierarchies of String Languages Generated by Deterministic Tree Transducers. Developments in Language Theory 2001: 228-238 - Zoltán Ésik:
The Equational Theory of Fixed Points with Applications to Generalized Language Theory. Developments in Language Theory 2001: 21-36 - Zoltán Ésik, Zoltán L. Németh:
Automata on Series-Parallel Biposets. Developments in Language Theory 2001: 217-227 - Henning Fernau, Ralf Stiebe:
Valuated and Valence Grammars: An Algebraic View. Developments in Language Theory 2001: 281-292 - Christian Glaßer, Heinz Schmitz:
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. Developments in Language Theory 2001: 251-261 - Vesa Halava, Tero Harju:
An Undecidability Result Concerning Periodic Morphisms. Developments in Language Theory 2001: 304-310 - Tero Harju:
Decision Questions on Integer Matrices. Developments in Language Theory 2001: 57-68 - Hendrik Jan Hoogeboom:
Context-Free Valence Grammars - Revisited. Developments in Language Theory 2001: 293-303 - Juraj Hromkovic, Georg Schnitger:
On the Power of Randomized Pushdown Automata. Developments in Language Theory 2001: 262-271 - Masami Ito, Yoshiyuki Kunimochi:
Some Petri Net Languages and Codes. Developments in Language Theory 2001: 69-80 - Manfred Kudlek, Yurii Rogozhin:
A Universal Turing Machine with 3 States and 9 Symbols. Developments in Language Theory 2001: 311-318 - Dietrich Kuske:
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable. Developments in Language Theory 2001: 206-216 - Gerhard Lischke:
The Root of a Language and Its Complexity. Developments in Language Theory 2001: 272-280 - Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors and Fragment Assembly. Developments in Language Theory 2001: 349-358 - Gundula Niemann, Jens R. Woinowski:
The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages. Developments in Language Theory 2001: 197-205 - Gundula Niemann, Johannes Waldmann:
Some Regular Languages That Are Church-Rosser Congruential. Developments in Language Theory 2001: 330-339 - Helmut Prodinger:
Words, Permutations, and Representations of Numbers. Developments in Language Theory 2001: 81-99 - Alexander A. Razborov:
Proof Complexity of Pigeonhole Principles. Developments in Language Theory 2001: 100-116 - Antonio Restivo, Sergio Salemi:
Words and Patterns. Developments in Language Theory 2001: 117-129
skipping 5 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-15 09:38 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