Остановите войну!
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
- 2000
- Grzegorz Rozenberg, Wolfgang Thomas:
Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999. World Scientific 2000, ISBN 981-02-4380-4 [contents] - 1999
- Yves Andre, Francis Bossut, Anne-Cécile Caron:
On decidability of boundedness property for regular path queries. Developments in Language Theory 1999: 245-256 - Stefan Andrei, Manfred Kudlek:
Bidirectional parsing for linear languages. Developments in Language Theory 1999: 257-269 - Marcella Anselmo:
A non-ambiguous language factorization problem. Developments in Language Theory 1999: 141-152 - Marie-Pierre Béal, Olivier Carton:
Asynchronous sliding block maps. Developments in Language Theory 1999: 47-59 - Henning Bordihn, Markus Holzer:
Cooperating distributed grammar systems with non-terminating components. Developments in Language Theory 1999: 305-315 - Anne Brüggemann-Klein, Derick Wood:
Caterpillars, context, tree automata and tree pattern matching. Developments in Language Theory 1999: 270-285 - Thomas Buchholz, Andreas Klein, Martin Kutrib:
On tally languages and generalized interacting automata. Developments in Language Theory 1999: 316-325 - Cristian Calude, Elena Calude:
Bisimulations and behaviour of nondeterministic automata. Developments in Language Theory 1999: 60-70 - Arturo Carpi, Aldo de Luca, Stefano Varricchio:
Special factors in some combinational structures. Developments in Language Theory 1999: 3-13 - Julien Cassaigne:
Subword complexity and periodicity in two or more dimensions. Developments in Language Theory 1999: 14-21 - Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski:
Table-driven and context-sensitive collage languages. Developments in Language Theory 1999: 326-337 - Henning Fernau, Klaus Reinhardt, Ludwig Staiger:
Decidability of code properties. Developments in Language Theory 1999: 153-163 - Rudolf Freund, Franziska Freund:
Test tube systems: when two tubes are enough. Developments in Language Theory 1999: 338-350 - Markus Holzer:
On fixed and general membership for external and internal contextual languages. Developments in Language Theory 1999: 351-361 - Petr Jiricka, Jaroslav Král:
Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata. Developments in Language Theory 1999: 71-80 - Juhani Karhumäki, Sabrina Mantaci:
Defect theorems for trees. Developments in Language Theory 1999: 164-177 - Juhani Karhumäki, Wojciech Plandowski:
On the complexity of computing the order of repetition of a string. Developments in Language Theory 1999: 178-184 - Nils Klarlund, Niels Damgaard, Michael I. Schwartzbach:
Yakyak: parsing with logical side constraints. Developments in Language Theory 1999: 286-301 - Pavel Kveton, Václav Koubek:
Functions preserving classes of languages. Developments in Language Theory 1999: 81-102 - John Loftus, Jeffrey O. Shallit, Ming-wei Wang:
New problems of pattern avoidance. Developments in Language Theory 1999: 185-199 - Luis-Miguel Lopez, Philippe Narbel:
Substitutions from Rauzy induction (extended abstract). Developments in Language Theory 1999: 200-209 - Ján Manuch:
Characterization of a word by its subwords. Developments in Language Theory 1999: 210-219 - Carlos Martín-Vide, Alexandru Mateescu:
Contextual grammars with trajectories. Developments in Language Theory 1999: 362-374 - Gundula Niemann, Friedrich Otto:
Restarting automata, Church-Rosser languages, and representations of r.e. languages. Developments in Language Theory 1999: 103-114 - Ion Petre:
On semilinearity in formal power series. Developments in Language Theory 1999: 220-231 - Martin Plátek:
Weak cyclic forms of rw-automata. Developments in Language Theory 1999: 115-124 - José Ruiz, Pedro García:
Right and left strongly locally testable semigroups and languages. Developments in Language Theory 1999: 232-241 - Arto Salomaa, Sheng Yu:
On the decomposition of finite languages. Developments in Language Theory 1999: 22-31 - Ralf Stiebe:
Slender matrix languages. Developments in Language Theory 1999: 375-385
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-05-30 20:39 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