Acta Cybernetica, Volume 10

Volume 10, Numbers 1-2, 1991

• Brian D. Bunday:
  Analysis of the SCAN Service Polling Model. 1-14
  Electronic Edition (link) BibTeX
• János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
  Heuristic for the 0-1 Min-Knapsack Problem. 15-20
  Electronic Edition (link) BibTeX
• Gábor Galambos:
  A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectange Bin-Packing. 21-24
  Electronic Edition (link) BibTeX
• Nguyen Huong Lam, Do Long Van:
  On Strict Codes. 25-34
  Electronic Edition (link) BibTeX
• Igor Litovsky:
  Free Submonoids and Minimal omega-Generators of R^omega. 35-44
  Electronic Edition (link) BibTeX
• Alexandru Mateescu:
  Special Families of Matrix Languages and Decidable Problems. 45-52
  Electronic Edition (link) BibTeX
• Attila Nagy:
  Boolean-Type Retractable Automata with Traps. 53-64
  Electronic Edition (link) BibTeX
• Gheorghe Paun, Sorina Vicolov:
  Language Representations Starting from Fully Initial Languages. 65-70
  Electronic Edition (link) BibTeX
• János Sztrik:
  Modelling of Heterogeneous Multiprocessor Systems with Randomly Changing Parameters. 71-84
  Electronic Edition (link) BibTeX
• János Sztrik, L. Lukashuk:
  Modelling of a Communication System Evolving in a Random Environment. 85-92
  Electronic Edition (link) BibTeX
• Vu Duc Thi, N. K. Anh:
  Weak Dependencies in the Relational Datamodel. 93-100
  Electronic Edition (link) BibTeX
• Ralph Tindell:
  Covering Morphisms and Unique Minimal D-Schemes. 101-112
  Electronic Edition (link) BibTeX
• Sorina Vicolov:
  A Note on Fully Initial Grammars. 113-118
  Electronic Edition (link) BibTeX

Volume 10, Number 3, 1992

• Hans Dietmar Gröger:
  On the Randomized Complexity of Monotone Graph Properties. 119-128
  Electronic Edition (link) BibTeX
• 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-140
  Electronic Edition (link) BibTeX
• János Demetrovics, G. Hencsey, Leonid Libkin, Ilya B. Muchnik:
  Normal Form Relation Schemes: A New Characterization. 141-164
  Electronic Edition (link) BibTeX
• Alexander Meduna:
  Symbiotic EOL Systems. 165-172
  Electronic Edition (link) BibTeX
• Kai Salomaa:
  Alternation Bounds for Tree Automata. 173-198
  Electronic Edition (link) BibTeX
• Virgil Emil Cazanescu, Rodica Ceterchi:
  Initial and Final Congruences. 199-216
  Electronic Edition (link) BibTeX
• János Demetrovics, Lajos Rónyai:
  A Note on Intersection of Isotone Clones. 217-220
  Electronic Edition (link) BibTeX

Volume 10, Number 4, 1992

• András Ádám:
  A Criterion for the Simplicity of Finite Moore Automata. 221-236
  Electronic Edition (link) BibTeX
• Balázs Imreh:
  On a Special Composition of Tree Automata. 237-242
  Electronic Edition (link) BibTeX
• Jürgen Dassow, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa:
  Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure. 243-254
  Electronic Edition (link) BibTeX
• Eija Jurvanen:
  The Boolean Closure of DR-Recognizable Tree Languages. 255-272
  Electronic Edition (link) BibTeX
• B. Almási:
  A Queuing Model for a Processor-Shared Multi-Terminal System Subject to Breakdowns. 273-282
  Electronic Edition (link) BibTeX
• T. Makjamroen:
  The Self-organizing List and Processor Problems under Randomized Policies. 283-302
  Electronic Edition (link) BibTeX
• Gerhard J. Woeginger:
  Computing Maximum Valued Regions. 303-316
  Electronic Edition (link) BibTeX
• József Dombi, Gy. Lencsés:
  On the Boolean Structure of Fuzzy Logical Systems: A Counter Example. 317-322
  Electronic Edition (link) BibTeX
• László Szabó:
  On Minimal and Maximal Clones. 323-327
  Electronic Edition (link) BibTeX