Fundamenta Informaticae, Volume 64

Volume 64, Number 1-4, 2005

• Cristian S. Calude, Gheorghe Paun, Grzegorz Rozenberg:
  Contagious Creativity.
  
• Alexandru T. Balaban:
  Mathematical Chemistry: (3, g)-Cages with Girth g, Topological Indices, and Other Graph-Theoretical Problems. 1-16
  
• Gemma Bel Enguix, Maria Dolores Jiménez-López:
  Biosyntax. An Overview. 17-28
  
• Francesco Bernardini, Marian Gheorghe, Vincenzo Manca:
  On P Systems and Almost Periodicity. 29-42
  
• Cristian Calude, Sergiu Rudeanu:
  Proving as a Computable Procedure. 43-52
  
• Cezar Câmpeanu, Lila Kari, Andrei Paun:
  Results on Transforming NFA into DFCA. 53-63
  
• Matteo Cavaliere, Dragos Sburlan:
  Time and Synchronization in Membrane Systems. 65-77
  
• Rodica Ceterchi, Radu Gramatovici:
  On Total Contextual Grammars with Restricted Choice. 79-91
  
• Gabriel Ciobanu, Viorel Mihai Gontineac:
  An Automata Description of the Genetic Message Translation. 93-107
  
• Jürgen Dassow:
  Contextual Grammars with Subregular Choice. 109-118
  
• Michael Davidson, Lucian Ilie:
  Fast Data Compression with Antidictionaries. 119-134
  
• Liviu Petrisor Dinu:
  Rank Distance with Applications in Similarity of Natural Languages. 135-149
  
• Pál Dömösi, Manfred Kudlek:
  New Iteration Lemmata for Regular Languages. 151-157
  
• Henning Fernau, Rudolf Freund, Markus Holzer:
  Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. 159-170
  
• Radu Gramatovici, Florin Manea:
  Parsing Local Internal Contextual Languages with Context-Free Choice. 171-183
  
• Tom Head:
  Does Light Direct Life Toward Cosmic Awareness? 185-189
  
• Florentin Ipate, Tudor Balanescu:
  Refinement in Finite State Machine Testing. 191-203
  
• Florentin Ipate, Mike Holcombe:
  Complete Testing from a Stream X-Machine Specification. 205-216
  
• Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
  Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. 217-228
  
• Martin Kappes:
  On the Relationship Between Multiple Brackets and Selector Languages in Bracketed Contextual Grammars. 229-239
  
• Shankara Narayanan Krishna, Raghavan Rama, H. Ramesh:
  Further Results on Contextual and Rewriting P Systems. 241-253
  
• Manfred Kudlek:
  On Probabilistic Contextual Grammars. 255-260
  
• Vincenzo Manca:
  On the Logic and Geometry of Bilinear Forms. 261-273
  
• Radu Mardare, Corrado Priami:
  Logical Analysis of Biological Systems. 275-289
  
• Maurice Margenstern, Sergey Verlan, Yurii Rogozhin:
  Time-Varying Distributed H Systems: An Overview. 291-306
  
• Victor Mitrana:
  Marcus External Contextual Grammars: From One to Many Dimensions. 307-316
  
• Madhu Mutyam, Kamala Krithivasan, A. Siddhartha Reddy:
  On Characterizing Recursively Enumerable Languages by Insertion Grammars. 317-324
  
• Miroslav Novotný:
  Construction of Contextual Grammars. 325-340
  
• Alexander Okhotin, Kai Salomaa:
  Contextual Grammars with Uniform Sets of Trajectories. 341-351
  
• Gheorghe Paun, Mario J. Pérez-Jiménez, Juan Pazos, Alfonso Rodríguez-Patón:
  Symport/Antiport P Systems with Three Objects Are Universal. 353-367
  
• Zdzislaw Pawlak:
  Flow Graphs and Intelligent Data Analysis. 369-377
  
• Lech Polkowski, Maria Semeniuk-Polkowska:
  On Rough Set Logics Based on Similarity Relations. 379-390
  
• Arto Salomaa:
  On the Injectivity of Parikh Matrix Mappings. 391-404
  
• Giuseppe Scollo:
  omega-rewriting the Collatz Problem. 405-416
  
• Andrzej Skowron:
  Rough Sets and Vague Concepts. 417-431
  
• Doina Tatar:
  Word Sense Disambiguation by Machine Learning Approach: A Short Survey. 433-442
  
• Mark R. Titchener, Radu Nicolescu, Ludwig Staiger, T. Aaron Gulliver, Ulrich Speidel:
  Deterministic Complexity and Entropy. 443-461
  
• Ioan Tomescu:
  Asymptotic Properties of the Factors of Words Over a Finite Alphabet. 463-470
  
• Sheng Yu:
  State Complexity: Recent Results and Open Problems. 471-480