Journal: Fundamenta Informaticae

Volume 83, Issue 1-2

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