Остановите войну!
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 38 matches
- 1973
- Jean-Michel Autebert:
Quelques générateurs des langages algébriques. Automatentheorie und Formale Sprachen 1973: 124-131 - Joffroy Beauquier:
Une caractérisation des langages quasi-rationnels standards. Automatentheorie und Formale Sprachen 1973: 132-138 - Eberhard Bertsch:
Some considerations about classes of mappings between contextfree derivation systems. Automatentheorie und Formale Sprachen 1973: 278-283 - Joachim Biskup:
Zufällige Folgen und Bi-immunität. Automatentheorie und Formale Sprachen 1973: 202-207 - Franz-Josef Brandenburg:
Der Einfluß von Kontext auf spezielle CF-Grammatiken. Automatentheorie und Formale Sprachen 1973: 139-148 - Mario Dal Cin:
Fault-tolerance and stability of fuzzy-state automata. Automatentheorie und Formale Sprachen 1973: 36-44 - Volker Claus:
Die mittlere Additionsdauer eines Paralleladdierwerks. Automatentheorie und Formale Sprachen 1973: 208-209 - Joël Coffy:
On the number of multiplications required by the product of two matrices. Automatentheorie und Formale Sprachen 1973: 210-219 - Elmar Cohors-Fresenborg:
Elementare und subelementare Funktionenklassen über binären Bäumen. Automatentheorie und Formale Sprachen 1973: 220-229 - Armin B. Cremers, Otto Mayer, K. Weiss:
Zur Komplexität gesteuerter kontextfreier Ersetzungen. Automatentheorie und Formale Sprachen 1973: 149-155 - Lutz Eichner:
Bemerkungen über Homomorphismen endlicher in lineare Automaten. Automatentheorie und Formale Sprachen 1973: 45-53 - Erwin Engeler:
On the structure of algorithmic problems. Automatentheorie und Formale Sprachen 1973: 2-15 - Eckehart Hotzel:
Der Kaskadenzerlegungssatz für Halbautomaten. Automatentheorie und Formale Sprachen 1973: 54-63 - H. Hummel:
Konvergenzbetrachtungen bei der Vorhersage des Ausgabeverhaltens allgemeiner stochastischer Systeme. Automatentheorie und Formale Sprachen 1973: 64-73 - Klaus Indermark:
On lanov schemas with one memory location. Automatentheorie und Formale Sprachen 1973: 284-293 - Gerd Kaufholz:
Über die Vernetzungsstruktur von Maschinen. Automatentheorie und Formale Sprachen 1973: 230-238 - Manfred Kudlek:
Characterization of derivation sets of formal systems. Automatentheorie und Formale Sprachen 1973: 156-165 - Jan Maluszynski:
Reduction goals in bottom-up recognition. Automatentheorie und Formale Sprachen 1973: 294-300 - Otto Mayer:
Die Darstellung indizierter Sprachen durch Ausdrücke. Automatentheorie und Formale Sprachen 1973: 166-174 - Burkhard Monien:
On the simulation of time bounded machines. Automatentheorie und Formale Sprachen 1973: 239-248 - Thomas Ottmann:
Ketten und arithmetische Prädikate von endlichen Automaten. Automatentheorie und Formale Sprachen 1973: 74-80 - Wolfgang J. Paul:
Über die Zeit, die benötigt wird, um endliche Mengen umzuordnen. Automatentheorie und Formale Sprachen 1973: 249-253 - Zdzislaw Pawlak:
A mathematical model of digital computers. Automatentheorie und Formale Sprachen 1973: 16-22 - Volker Penner:
Über eine Hierarchie von Push-Down-entscheidbaren Mengen. Automatentheorie und Formale Sprachen 1973: 254-262 - Antonio Restivo:
Codes and aperiodic languages. Automatentheorie und Formale Sprachen 1973: 175-181 - Bernard J. Robinet:
Un modèle sémantique pour un langage simple de programmation. Automatentheorie und Formale Sprachen 1973: 301-310 - F. Rodriguez:
Une hierarchie infinie de cones d'accepteurs vérificateurs. Automatentheorie und Formale Sprachen 1973: 81-87 - G. Rose, Klaus Weihrauch:
A characterization of the classes L1 and R1 of primitive recursive wordfunctions. Automatentheorie und Formale Sprachen 1973: 263-266 - Arto Salomaa:
On some recent problems concerning developmental languages. Automatentheorie und Formale Sprachen 1973: 23-34 - Dieter Schütt:
Zustandsfolgenabbildungen von verallgemeinerten endlichen Automaten. Automatentheorie und Formale Sprachen 1973: 88-97
skipping 8 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-07-20 16:38 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