Acta Cybernetica, Volume 13

Volume 13, Number 1, 1997

• L. Bernátsky:
  Regular Expression Star-Freeness is PSPACE-Complete. 1-22
  
• Béla Csaba, G. Dányi:
  Server Problems and Regular Languages. 23-40
  
• Balázs Imreh:
  On alpha_i-Products of Nondeterministic Tree Automata. 41-54
  
• Erkki Mäkinen:
  On Lexicographic Enumeration of Regular and Context-Free Languages. 55-62
  
• Rainer E. Burkard, Guochuan Zhang:
  Bounded Space On-Line Variable-Sized Bin Packing. 63-76
  
• András Pluhár:
  Generalized Harary Games. 77-84
  
• Ágnes Achs:
  Evaluation Strategies of Fuzzy Datalog. 85-102
  

Volume 13, Number 2, 1997

• György Kovács, Patrick van Bommel:
  Framework for Generating Object-Oriented Databases from Conceptual Specifications. 103-140
  
• Alexandru Mateescu:
  CD Grammar Systems and Trajectories. 141-158
  
• Petr Sosík:
  On Hybrid Connectionist-Symbolic Models. 159-172
  
• György Vaszil:
  Various Communications in PC Grammar Systems. 173-196
  
• Rózsa Horváth Bokor:
  On Two-Step Methods for Stochastic Differential Equations. 197-207
  

Volume 13, Number 3, 1998

• Markus Lohrey:
  NP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars. 209-224
  
• Alexander Meduna:
  Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars. 225-242
  
• Ildikó Székely:
  Isomorphic Representation of Nondeterministic Nilpotent Automata. 243-256
  
• Mark Levene:
  On the Information Content of Semi-Structured Databases. 257-276
  
• Klaus-Dieter Schewe, Bernhard Thalheim:
  Limitations of Rule Triggering Systems for Integrity Maintenance in the Context of Transition Specifications. 277-304
  
• Csaba Szepesvári:
  Non-Markovian Policies in Sequential Decision Problems. 305-318
  
• Z. Blázsik, Cs. Holló, Balázs Imreh:
  On Decision-Mappings Related to Process Network Synthesis Problem. 319-328
  
• J. Fülöp, Balázs Imreh, Ferenc Friedler:
  On the Reformulation of Some Classes of PNS-Problems as Set Covering Problems. 329-338
  

Volume 13, Number 4, 1998

• Paolo Bottoni, Giancarlo Mauri, Piero Mussio, Gheorghe Paun:
  Grammars Working on Layered Strings. 339-358
  
• Judit Csima:
  On Extended Simple Eco-grammar Systems. 359-374
  
• Alexander Meduna:
  Descriptional Complexity of Multi-Continuous Grammars. 375-384
  
• Tatjana Petkovic, Miroslav Ciric, Stojan Bogdanovic:
  Decompositions of Automata and Transition Semigroups. 385-404
  
• László Szabó:
  On Minimal and Maximal Clones II. 405-412
  
• A. E. Csallner:
  Improving Storage Handling of Interval Methods for Global Optimization. 413-422
  
• Günter Rote, Gerhard J. Woeginger:
  Minimizing the Number of Tardy Jobs. 423-430
  
• Attila Sali Sr., Attila Sali:
  Generalized Dependencies in Relational Databases. 431-438
  
• Miklós Telek, András Pfening, Gábor Fodor:
  Analysis of the Completion Time of Markov Reward Models. 439-