![](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 39 matches
- 1980
- L. Csirmaz:
Structure of program runs of non-standard time. Acta Cybern. 4(4): 325-331 (1980) - Jürgen Dassow:
On some extensions of Indian parallel context free grammars. Acta Cybern. 4(4): 303-310 (1980) - F. Ferenci:
Groupoids of pseudoautomata. Acta Cybern. 4(4): 389-399 (1980) - Tamás Gergely, László Úry:
Nondeterministic programming within the frame of first order classical logic, Part 1. Acta Cybern. 4(4): 333-354 (1980) - Tamás Gergely, László Úry:
Nondeterministic programming within the frame of first order classical logic, Part 2. Acta Cybern. 4(4): 355-375 (1980) - Ki Hang Kim, Fred W. Roush:
Enumeration of certain words. Acta Cybern. 4(4): 383-387 (1980) - K. Tóth:
Completeness in non-simple and stable modal logics. Acta Cybern. 4(4): 377-382 (1980) - 1979
- A. Békéssy:
Estimation of average length of search on random zero-one matrices. Acta Cybern. 4(3): 241-245 (1979) - L. K. Bruckner:
On the Garden-of-Eden problem for one-dimensional cellular automata. Acta Cybern. 4(3): 259-262 (1979) - M. K. Chirkov:
On some types of incompletely specified automata. Acta Cybern. 4(2): 151-165 (1979) - János Demetrovics:
On the equivalence of candidate keys with Sperner systems. Acta Cybern. 4(3): 247-252 (1979) - János Demetrovics, László Hannák:
The cardinality of closed sets in pre-complete classes in k-valued logics. Acta Cybern. 4(3): 273-277 (1979) - Z. Gidófalvy:
A new statistical solution for the deadlock problem in resource management systems. Acta Cybern. 4(3): 253-258 (1979) - Hans-Dietrich O. F. Gronau:
On Sperner families in which no 3 sets have an empty intersection. Acta Cybern. 4(2): 213-220 (1979) - Hans-Dietrich O. F. Gronau:
Recognition of monotone functions. Acta Cybern. 4(3): 279-281 (1979) - F. Jólesz, M. Szilágyi:
A possible new model of neurons and neural processes based on the quantum-mechanical theory of measurement. Acta Cybern. 4(2): 221-239 (1979) - Endre Katona:
Linear parallel maps of tessellation automata. Acta Cybern. 4(3): 263-268 (1979) - Ki Hang Kim, Fred W. Roush:
Schützenberger's monoids. Acta Cybern. 4(3): 269-272 (1979) - Z. Laborczi:
A note on deadlocks. Acta Cybern. 4(2): 179-184 (1979) - Ferenc Móricz, A. Varga, Péter Ecsedi-Tóth:
A method for minimizing partially defined Boolean functions. Acta Cybern. 4(3): 283-290 (1979) - Joseph Sifakis:
Use of Petri nets for performance evaluation. Acta Cybern. 4(2): 185-202 (1979) - K. Tóth:
Modal logics with function symbols. Acta Cybern. 4(3): 291-302 (1979) - Katalin Vesztergombi:
Some remarks on the chromatic number of the strong product of graphs. Acta Cybern. 4(2): 207-212 (1979) - Z. Zachar:
The solvability of the equivalence problem for deterministic frontier-to-root tree transducers. Acta Cybern. 4(2): 167-177 (1979) - Bohdan Zelinka:
Strongly connected digraphs in which each edge is contained in exactly two cycles. Acta Cybern. 4(2): 203-205 (1979) - 1978
- Hajnal Andréka, István Németi:
The generalized completeness of Horn predicate-logic as a programming language. Acta Cybern. 4(1): 3-10 (1978) - Michael A. Arbib, Ernest G. Manes:
Tree transformations and the semantics of loop-free programs. Acta Cybern. 4(1): 11-17 (1978) - Andrei P. Ershov:
Mixed computation in the class of recursive program schemata. Acta Cybern. 4(1): 19-23 (1978) - M. A. Gavrilov:
Certain operations with the sets of discrete states. Acta Cybern. 4(1): 25-35 (1978) - Ferenc Gécseg, Magnus Steinby:
Minimal ascending tree automata. Acta Cybern. 4(1): 37-44 (1978)
skipping 9 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-06-27 13:59 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