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

Volume 29, Issue 7

1089 -- 1105Meng Zhang, Yi Zhang. Space-Efficient Representations for Glushkov Automata
1107 -- 1117Hong Wang, Jie Guan, Lin Ding. On Equivalence Relations of State Diagram of Cascade Connection of an LFSR into an NFSR
1119 -- 1142Ömür Kivanç Kürkçü, Ersin Aslan. A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
1143 -- 1150Minjia Shi, Hongwei Zhu, Liqin Qian, Patrick Solé. On Self-Dual Four Circulant Codes
1151 -- 1164Canan Çiftçi, Aysun Aytaç. Exponential Independence Number of Some Graphs
1165 -- 1179Wen Chean Teh. Compositions of Functions and Permutations Specified by Minimal Reaction Systems
1181 -- 1201Shuo Yan, Yun-Yong Zhang, Binfeng Yan, Lin Yan, Jinfeng Kou. Data Associations Between Two Hierarchy Trees
1203 -- 1213Toshihiro Koga. Context-Freeness of Parsing Expression Languages is Undecidable
1215 -- 1230Mehdy Roayaei, Mohammadreza Razzazi. Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
1231 -- 1245Mostafa Nouri Baygi. The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem