![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 34 matches
- 1977
- Tadashi Ae, Toru Kikuno, Norio Tamura:
A comparative study of one-counter Ianov schemes. Theoretical Computer Science 1977: 83-95 - Helmut Alt:
Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen. Theoretical Computer Science 1977: 123-131 - Jean-Michel Autebert:
Gylindres de languages simples et pseudo-simples. Theoretical Computer Science 1977: 149-153 - Leonard Berman, Juris Hartmanis:
On polynomial time isomorphisms of complete sets. Theoretical Computer Science 1977: 1-16 - Wolfgang Bibel:
A syntactic connection between proof procedures and refutation prcedures. Theoretical Computer Science 1977: 215-225 - Luc Boasson:
Un langage algébrique non-générateur. Theoretical Computer Science 1977: 145-148 - Franz-Josef Brandenburg:
On one-way auxiliary pushdown automata. Theoretical Computer Science 1977: 132-144 - H. Bremer:
Ein vollständiges Problem auf der Baummaschine. Theoretical Computer Science 1977: 391-406 - Bruno Courcelle:
On a description of tree-languages by languages. Theoretical Computer Science 1977: 45-50 - Werner Damm:
Higher type program schemes and their tree languages. Theoretical Computer Science 1977: 51-72 - Ernst-Wolfgang Dieterich:
Grobstrukturen für kontextfreie Grammatiken. Theoretical Computer Science 1977: 96-105 - Lutz Eichner:
Bemerkungen zu den Übergangshalbgruppen linear realisierbarer Automaten. Theoretical Computer Science 1977: 234-258 - Klaus Estenfeld:
Strukturelle Untersuchungen zur schwersten kontextfreien Sprache. Theoretical Computer Science 1977: 106-122 - G. Gati:
Aspects of unbounded parallelism. Theoretical Computer Science 1977: 292-305 - Friedrich W. von Henke:
Towards automation of proofs by induction. Theoretical Computer Science 1977: 208-214 - Hagen Huwig, Volker Claus:
Das Äquivalenzproblem für spezielle klassen von Loop-1-programmen. Theoretical Computer Science 1977: 73-82 - Gérard Jacob:
Decidabilite de la finitude des demi-groupes de matrices. Theoretical Computer Science 1977: 259-269 - Tiko Kameda:
A polynomial-time test for the deadlock-freedom of computer systems. Theoretical Computer Science 1977: 282-291 - Laurent Kott:
systèmes schématiques généralises. Theoretical Computer Science 1977: 184-189 - Jacques Loeckx:
Formale Korrecktheitsbeweise für While-Programme. Theoretical Computer Science 1977: 190-207 - V. Lohberger:
Eine klasse geordneter Monoide und ihre Anwendbarkeit in der Fixpunktsemantik. Theoretical Computer Science 1977: 169-183 - Burkhard Monien:
The LBA-problem and the transormability of the class epsilon2. Theoretical Computer Science 1977: 339-350 - Mike Paterson:
New bounds on formula size. Theoretical Computer Science 1977: 17-26 - Dominique Perri, Marcel Paul Schützenberger:
Codes et sous-monoides possedant des mots neutres. Theoretical Computer Science 1977: 270-281 - Jean-François Perrot:
Informationque et algébre la theorie des codes a longueur variable. Theoretical Computer Science 1977: 27-44 - Rainer Prinoth:
Eigenschaften färbbarer Petri-Netze. Theoretical Computer Science 1977: 306-318 - C. Reynvaan, Claus-Peter Schnorr:
Über Netzwerkgrößen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten Operationen. Theoretical Computer Science 1977: 368-390 - F. Rodriguez:
Familles de languages fermées par crochet et crochet ouvert. Theoretical Computer Science 1977: 154-168 - R. Schauerte:
Über die Länge einer Berechnung bei linearer Parameter-abhängigkeit der Operationszeit. Theoretical Computer Science 1977: 407-413 - Britta Schinzel:
Struktur von Programmbündeln. Theoretical Computer Science 1977: 226-233
skipping 4 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-20 02:33 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