Fundamenta Informaticae, Volume 83

Volume 83, Numbers 1-2, 2008

• Margaret Archibald, Vasco Brattka, Clemens Heuberger:
  Randomness with Respect to the Signed-Digit Representation. 1-19
  Electronic Edition (link) BibTeX
• Laurent Bienvenu, Wolfgang Merkle, Alexander Shen:
  A Simple Proof of Miller-Yu Theorem. 21-24
  Electronic Edition (link) BibTeX
• Douglas S. Bridges, Luminita Vîta:
  Proximal Connectedness. 25-34
  Electronic Edition (link) BibTeX
• Jürgen Dassow, Ralf Stiebe:
  Nonterminal Complexity of Some Operations on Context-Free Languages. 35-49
  Electronic Edition (link) BibTeX
• Henning Fernau, Ralf Stiebe:
  Blind Counter Automata on omega-Words. 51-64
  Electronic Edition (link) BibTeX
• Rudolf Freund, Marion Oswald:
  Regular omega-Languages Defined by Finite Extended Spiking Neural P Systems. 65-73
  Electronic Edition (link) BibTeX
• Yuan Gao, Kai Salomaa, Sheng Yu:
  The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal. 75-89
  Electronic Edition (link) BibTeX
• T. Aaron Gulliver, Isaiah Makwakwa, Ulrich Speidel:
  On the Generation of Aperiodic and Periodic Necklaces via T-augmentation. 91-107
  Electronic Edition (link) BibTeX
• Michael Gössel, Egor S. Sogomonyan:
  A Non-linear Split Error Detection Code. 109-115
  Electronic Edition (link) BibTeX
• Nicholas J. Hay:
  Simulation Complexity. 117-140
  Electronic Edition (link) BibTeX
• Peter Hertling, Christoph Spandl:
  Computability Theoretic Properties of the Entropy of Gap Shifts. 141-157
  Electronic Edition (link) BibTeX
• Sanjay Jain, Frank Stephan, Ye Nan:
  Prescribed Learning of Indexed Families. 159-175
  Electronic Edition (link) BibTeX
• Boris Ryabko:
  Applications of Kolmogorov Complexity and Universal Codes to Nonparametric Estimation of Characteristics of Time Series. 177-196
  Electronic Edition (link) BibTeX
• Victor L. Selivanov, Klaus W. Wagner:
  Complexity of Topological Properties of Regular omega-Languages. 197-217
  Electronic Edition (link) BibTeX
• Xizhong Zheng:
  A Hierarchy of Computably Enumerable Reals. 219-230
  Electronic Edition (link) BibTeX

Volume 83, Number 3, 2008

• Ashish Ghosh, Mrinal Kanti Das:
  Non-dominated Rank based Sorting Genetic Algorithms. 231-252
  Electronic Edition (link) BibTeX
• Benjamin Grimberg, Michael Kaminski:
  First-Order Ground Non-Monotonic Modal Logic. 253-276
  Electronic Edition (link) BibTeX
• Éric Laugerotte, Djelloul Ziadi:
  WeightedWord Recognition. 277-298
  Electronic Edition (link) BibTeX
• Chia-Chen Lin, Shing-Shoung Wang:
  An Edge-based Image Copy Detection Scheme. 299-318
  Electronic Edition (link) BibTeX
• Jen-Chang Liu, Ming-Hong Shih:
  Generalizations of Pixel-Value Differencing Steganography for Data Hiding in Images. 319-335
  Electronic Edition (link) BibTeX

Volume 83, Number 4, 2008

• Fabio Farina, Alberto Dennunzio:
  A Predator-Prey Cellular Automaton with Parasitic Interactions and Environmental Effects. 337-353
  Electronic Edition (link) BibTeX
• Carlo Meghini, Yannis Tzitzikas, Nicolas Spyratos:
  Abduction for Accessing Information Sources. 355-387
  Electronic Edition (link) BibTeX
• Daniel Simson, Mariusz Wojewódzki:
  An Algorithmic Solution of a Birkhoff Type Problem. 389-410
  Electronic Edition (link) BibTeX
• K. G. Subramanian, Do Long Van, P. Helen Chandra, Nghiem Do Quyen:
  Array Grammars with Contextual Operations. 411-428
  Electronic Edition (link) BibTeX
• Michael Winter:
  A Relation-Algebraic Theory of Bisimulations. 429-449
  Electronic Edition (link) BibTeX
• Philippe Balbiani, Petar Iliev, Dimiter Vakarelov:
  A Modal Logic for Pawlak's Approximation Spaces with Rough Cardinality n. 451-464
  Electronic Edition (link) BibTeX