Journal: Int. J. Found. Comput. Sci.

Volume 23, Issue 1

0 -- 0Ian McQuillan, Giovanni Pighizzini. Preface
5 -- 19Martin Kappes, Andreas Malcher, Detlef Wotschke. In Memoriam Chandra Kintala
21 -- 35Janusz A. Brzozowski, Baiyu Li, Yuli Ye. On the Complexity of the Evaluation of Transient Extensions of Boolean Functions
37 -- 50Cristian S. Calude, Kai Salomaa, Tania Roblot. State-Size Hierarchy for Finite-State Complexity
51 -- 66Bo Cui, Yuan Gao, Lila Kari, Sheng Yu. State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal
67 -- 85Krystian Dudzinski, Stavros Konstantinidis. Formal Descriptions of Code Properties: Decidability, Complexity, Implementation
87 -- 98Zoltán Ésik. Ordinal Automata and Cantor Normal Form
99 -- 114Ronny Harbich, Bianca Truthe. A Comparison of the Descriptional Complexity of Classes of Limited Lindenmayer Systems: Part I
115 -- 131Markus Holzer, Sebastian Jakobi, Martin Kutrib. The Magic Number Problem for Subregular Language Families
133 -- 146Przemyslaw Prusinkiewicz, Mitra Shirmohammadi, Faramarz Samavati. L-Systems in Geometric Modeling
147 -- 172Adilson Luiz Bonifácio, Arnaldo Vieira Moura, Adenilso da Silva Simão. Model Partitions and Compact Test Case Suites
173 -- 184Junping Zhou, Minghao Yin, Xiangtao Li, Jinyan Wang. Phase Transitions of EXPSPACE-Complete Problems: a Further Step
185 -- 206Egor Dolzhenko, Natasa Jonoska. Two-Dimensional Languages and Cellular Automata
207 -- 223Kalpana Mahalingam, K. G. Subramanian. Product of Parikh Matrices and Commutativity
225 -- 242César Domínguez, Dominique Duval. A Parameterization Process: from a Functorial Point of View