Acta Cybernetica, Volume 11

Volume 11, Numbers 1-2, 1993

• Hans L. Bodlaender:
  A Tourist Guide through Treewidth. 1-22
  Electronic Edition (link) BibTeX
• Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger:
  A Lower Bound for On-Line Vector-Packing Algorithms. 23-34
  Electronic Edition (link) BibTeX
• János Demetrovics, Vu Duc Thi:
  Some Problems Concerning Armstrong Relations of Dual Schemes and Relation Schemes in the Relational Datamodel. 35-48
  Electronic Edition (link) BibTeX
• Klaus-Dieter Schewe, Bernhard Thalheim:
  Fundamental Concepts of Object Oriented Databases. 49-84
  Electronic Edition (link) BibTeX
• Rudolf Berghammer:
  On the Characterization of the Integers: The Hidden Function Problem Revisited. 85-96
  Electronic Edition (link) BibTeX
• Do Long Van, Nguyen Huong Lam, Phan Trung Huy:
  On Codes of Bi-Infinite Words. 97-110
  Electronic Edition (link) BibTeX
• M. Biró, P. Danyi, P. Gelléri:
  Market Oriented Integration of MS-Windows-Based Tools for Distributed Decision Support. 111-119
  Electronic Edition (link) BibTeX

Volume 11, Number 3, 1994

• I. Babcsányi, A. Nagyr:
  Mealy-Automata in Which the Output-Equivalence is a Congruence. 121-126
  Electronic Edition (link) BibTeX
• Nguyen Huong Lam, Do Long Van:
  Measure of Infinitary Codes. 127-138
  Electronic Edition (link) BibTeX
• Heinz Faßbender, Heiko Vogler:
  A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowing. 139-168
  Electronic Edition (link) BibTeX
• Y. Fong, F. K. Huang, R. Wiegandt:
  Radical Theory for Group Semiautomata. 169-188
  Electronic Edition (link) BibTeX
• Victor Mitrana, Gheorghe Paun, Grzegorz Rozenberg:
  Structuring Grammar Systems by Priorities and Hierarchies. 189-204
  Electronic Edition (link) BibTeX
• János Demetrovics, Vu Duc Thi:
  Normal Forms and Minimal Keys in the Relational Datamodel. 205-216
  Electronic Edition (link) BibTeX
• Le Thi Thanh:
  On Strong-Generalized Positive Boolean Dependencies. 217-232
  Electronic Edition (link) BibTeX
• Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao:
  Partitioning Graphs into Two Trees. 233-240
  Electronic Edition (link) BibTeX

Volume 11, Number 4, 1994

• Jeanne Devolder, Michel Latteux, Igor Litovsky, Ludwig Staiger:
  Codes and Infinite Words. 241-256
  Electronic Edition (link) BibTeX
• Balázs Imreh, A. M. Ito:
  A Note on Regular Strongly Shuffle-Closed Languages. 257-260
  Electronic Edition (link) BibTeX
• Armin Kühnemann, Heiko Vogler:
  A Pumping Lemma for Output Languages of Attributed Tree Transducers. 261-306
  Electronic Edition (link) BibTeX
• Alexander Meduna, A. Gopalaratnam:
  On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions. 307-324
  Electronic Edition (link) BibTeX
• E. K. Horváth:
  Invariance Groups of Threshold Functions. 325-332
  Electronic Edition (link) BibTeX
• Valery A. Vardanian:
  On the Complexity of Dynamic Tests for Logic Functions. 333-344
  Electronic Edition (link) BibTeX
• Vu Duc Thi, Le Thi Thanh:
  Some Remarks on Functional Dependencies in Relational Datamodels. 345-352
  Electronic Edition (link) BibTeX