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 41 matches
- 1976
- Ingo Baeger, Peter Döring, Roswitha März:
Ein Verfahren zur suboptimalen Regelung beim Tracking-Problem. J. Inf. Process. Cybern. 12(3): 133-146 (1976) - Gunter Bär:
Umformungsmöglichkeiten für die Restriktionen eines 0-1-Optimierungsproblems. J. Inf. Process. Cybern. 12(11/12): 607-610 (1976) - Frank Beichelt:
Die Verfügbarkeit eines doublierten Systems mit prophylaktischer Erneuerung. J. Inf. Process. Cybern. 12(7): 355-361 (1976) - Günter Böttcher, Kurt Nawrotzki:
Stationäre Anfangsverteilungen stochastischer Automaten II. J. Inf. Process. Cybern. 12(10): 459-470 (1976) - Hans-Dieter Burkhard:
Identifizierungsexperimente an asychronen Automaten. J. Inf. Process. Cybern. 12(1/2): 45-59 (1976) - Hans-Dieter Burkhard:
Zum Längenproblem homogener Experimente an determinierten und nicht-deterministischen Automaten. J. Inf. Process. Cybern. 12(6): 301-306 (1976) - Wolfgang Coy:
Zur Konstrukion einfach testbarer Schaltkreise. J. Inf. Process. Cybern. 12(4/5): 171-179 (1976) - Wolfgang Coy, Andreas Vogel:
Eine einfach strukturierte Schaltwerk-Normalform mit niedriger Test-Komplexität. J. Inf. Process. Cybern. 12(11/12): 557-565 (1976) - Hans Daduna:
Stochastische Algebra über höchstens abzählbaren Mengen. J. Inf. Process. Cybern. 12(11/12): 589-598 (1976) - Jürgen Dassow:
Eine neue Funktion für Lindenmayer-Systeme. J. Inf. Process. Cybern. 12(11/12): 515-521 (1976) - Phan Dinh Dieu:
A Note on Iterative Arrays of Finite Automata over the One-letter Alphabet. J. Inf. Process. Cybern. 12(11/12): 551-555 (1976) - Phan Dinh Dieu, Pham Tra Ân:
Probabilistic Automata with a Time-variant Structure. J. Inf. Process. Cybern. 12(1/2): 3-27 (1976) - Siegmar Gerber, Holger Schackert:
Bewegungsdeterminierte linear-beschränkte Akzeptoren und voreindeutige Grammatiken. J. Inf. Process. Cybern. 12(8/9): 415-420 (1976) - Jan Grabowski:
Unpredictable Sets. J. Inf. Process. Cybern. 12(8/9): 439-447 (1976) - Petr Hájek:
Observationsfunktorenkalküle und die Logik der automatisierten Forschung. J. Inf. Process. Cybern. 12(4/5): 181-186 (1976) - Georg Hallbauer:
Wettlauffreie Kodierung mit gleichzeitiger Zustandsreduktion bei ungetakteten Folgeschaltungen. J. Inf. Process. Cybern. 12(4/5): 193-225 (1976) - Walter Harnau:
Eine Verallgemeinerung der Vertauschbarkeit in der k-wertigen Logik. J. Inf. Process. Cybern. 12(1/2): 33-43 (1976) - Armin Hemmerling:
Turing-Maschinen und Zellularräume in der Ebene. J. Inf. Process. Cybern. 12(8/9): 379-402 (1976) - Walter Issel:
A model for PL/I list-processing using the method of semantic bricks. J. Inf. Process. Cybern. 12(11/12): 567-587 (1976) - Evzen Kindler:
On the way to a mathematical theory of simulation. J. Inf. Process. Cybern. 12(10): 497-504 (1976) - Reinhard Klette:
Erkennung allgemein rekursiver Funktionen. J. Inf. Process. Cybern. 12(4/5): 227-243 (1976) - Rolf Lindner, Günter Werner:
Eine vergleichende Analyse von Stopstrategien für allgemein-rekursive Prognosen. J. Inf. Process. Cybern. 12(6): 275-280 (1976) - Kurt Mehlhorn:
An Improved Lower Bound on the Formula Complexity of Context-free Recognition. J. Inf. Process. Cybern. 12(11/12): 523-524 (1976) - Hans-Georg Meissner:
Über die Fortsetzbarkeit von sequentiellen Baum-Operatoren mit endlichem Gewicht. J. Inf. Process. Cybern. 12(8/9): 403-414 (1976) - Hans-Georg Meissner:
Limes-Erkennung von regulären und linearen Sprachen mit Optimalitätseigenschaften. J. Inf. Process. Cybern. 12(11/12): 525-549 (1976) - D. P. Mittal:
On Non-additive Information Improvement. J. Inf. Process. Cybern. 12(4/5): 187-192 (1976) - Constantin Virgil Negoita, Dan A. Ralescu:
L-Fuzzy Sets and L-Flou Sets. J. Inf. Process. Cybern. 12(11/12): 599-605 (1976) - Juhani Nieminen:
Realizing the distance matrix of a graph. J. Inf. Process. Cybern. 12(1/2): 29-31 (1976) - Hans Werner Pohl:
Über kontextfreie stochastische Sprachen. J. Inf. Process. Cybern. 12(6): 313-323 (1976) - Nguyen Xuan Quynh:
An algorithm for fault detection in logical combinational many-level fan-out networks. J. Inf. Process. Cybern. 12(10): 483-496 (1976)
skipping 11 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 2025-01-13 07:59 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