default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDActa Cybernetica, Volume 10
Volume 10, Numbers 1-2, 1991
- Brian D. Bunday:
Analysis of the SCAN Service Polling Model. 1-14 - János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
Heuristic for the 0-1 Min-Knapsack Problem. 15-20 - Gábor Galambos:
A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectangle Bin-Packing. 21-24 - Nguyen Huong Lam, Do Long Van:
On Strict Codes. 25-34 - Igor Litovsky:
Free Submonoids and Minimal ω-Generators of Rω. 35-43 - Alexandru Mateescu:
Special Families of Matrix Languages and Decidable Problems. 45-51 - Attila Nagy:
Boolean-Type Retractable Automata with Traps. 23-64 - Gheorghe Paun, Sorina Vicolov:
Language Representations Starting from Fully Initial Languages. 65-70 - János Sztrik:
Modelling of Heterogeneous Multiprocessor Systems with Randomly Changing Parameters. 71-84 - János Sztrik, L. Lukashuk:
Modelling of a Communication System Evolving in a Random Environment. 85-91 - Vu Duc Thi, N. K. Anh:
Weak Dependencies in the Relational Datamodel. 93-100 - Ralph Tindell:
Covering Morphisms and Unique Minimal D-Schemes. 101-112 - Sorina Vicolov:
A Note on Fully Initial Grammars. 113-118
Volume 10, Number 3, 1992
- Hans Dietmar Gröger:
On the Randomized Complexity of Monotone Graph Properties. 119-127 - János Demetrovics, G. Hencsey, Leonid Libkin, Ilya B. Muchnik:
On the Interaction Between Closure Operations and Choice Functions with Applications to Relational Database. 129-139 - János Demetrovics, G. Hencsey, Leonid Libkin, Ilya B. Muchnik:
Normal Form Relation Schemes: A New Characterization. 141-153 - Alexander Meduna:
Symbiotic EOL Systems. 165-172 - Kai Salomaa:
Alternation Bounds for Tree Automata. 173-197 - Virgil Emil Cazanescu, Rodica Ceterchi:
Initial and Final Congruences. 199-215 - János Demetrovics, Lajos Rónyai:
A Note on Intersection of Isotone Clones. 217-220
Volume 10, Number 4, 1992
- András Ádám:
A Criterion for the Simplicity of Finite Moore Automata. 221-236 - Balázs Imreh:
On a Special Composition of Tree Automata. 237-242 - Jürgen Dassow, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure. 243-253 - Eija Jurvanen:
The Boolean Closure of DR-Recognizable Tree Languages. 255-272 - Béla Almási:
A Queuing Model for a Processor-Shared Multi-Terminal System Subject to Breakdowns. 273-282 - T. Makjamroen:
The Self-organizing List and Processor Problems under Randomized Policies. 283-302 - Gerhard J. Woeginger:
Computing Maximum Valued Regions. 303-315 - József Dombi, Gy. Lencsés:
On the Boolean Structure of Fuzzy Logical Systems: A Counter Example. 317-322 - László Szabó:
On Minimal and Maximal Clones. 323-327
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.
last updated on 2024-11-06 20:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
