- Stéphane Demri, David Nowak:
Reasoning about Transfinite Sequences. Int. J. Found. Comput. Sci. 18(1): 87-112 (2007) - Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. 18(2): 217-226 (2007) - Frank Drewes:
Links. Int. J. Found. Comput. Sci. 18(6): 1187-1196 (2007) - Zoltán Ésik, Werner Kuich:
Boolean Fuzzy Sets. Int. J. Found. Comput. Sci. 18(6): 1197-1207 (2007) - Henning Fernau:
Programmed Grammars with Rule Queues. Int. J. Found. Comput. Sci. 18(6): 1209-1213 (2007) - Limor Fix, Orna Grumberg, Amnon Heyman, Tamir Heyman, Assaf Schuster:
Verifying Very Large Industrial Circuits Using 100 Processes and Beyond. Int. J. Found. Comput. Sci. 18(1): 45-62 (2007) - Paola Flocchini, Miao Jun Huang, Flaminia L. Luccio:
Decontaminating Chordal Rings and Tori Using Mobile Agents. Int. J. Found. Comput. Sci. 18(3): 547-563 (2007) - Rudolf Freund, Marion Oswald:
Partial Halting in P Systems. Int. J. Found. Comput. Sci. 18(6): 1215-1225 (2007) - Akihiro Fujiwara, Satoshi Kamio, Akiko Takehara:
Procedures for Computing the Maximum with DNA. Int. J. Found. Comput. Sci. 18(3): 475-493 (2007) - Yan Gao, Hendrik Jan Hoogeboom:
P Systems with Single passenger Carriers. Int. J. Found. Comput. Sci. 18(6): 1227-1235 (2007) - Ferenc Gécseg:
Classes of Tree Languages Determined by Classes of Monoids. Int. J. Found. Comput. Sci. 18(6): 1237-1246 (2007) - Mathieu Giraud, Philippe Veber, Dominique Lavenier:
Path-Equivalent Developments in Acyclic Weighted Automata. Int. J. Found. Comput. Sci. 18(4): 799-811 (2007) - Jens Glöckler:
Forgetting Automata and Unary Languages. Int. J. Found. Comput. Sci. 18(4): 813-827 (2007) - Jozef Gruska, Salvatore La Torre, Mimmo Parente:
The Firing Squad Synchronization Problem on Squares, Toruses and Rings. Int. J. Found. Comput. Sci. 18(3): 637-654 (2007) - Joachim Gudmundsson, C. Barry Jay:
Preface. Int. J. Found. Comput. Sci. 18(2): 195-196 (2007) - Vesa Halava, Tero Harju, Mika Hirvensalo:
Undecidability Bounds for Integer Matrices Using Claus Instances. Int. J. Found. Comput. Sci. 18(5): 931-948 (2007) - Brian Herlihy, Peter Schachte, Harald Søndergaard:
Un-Kleene Boolean equation Solving. Int. J. Found. Comput. Sci. 18(2): 227-250 (2007) - Juha Honkala:
The D0l omega-equivalence Problem. Int. J. Found. Comput. Sci. 18(1): 181-194 (2007) - Oscar H. Ibarra, Sara Woodworth:
Characterizing Regular Languages by Spiking Neural P Systems. Int. J. Found. Comput. Sci. 18(6): 1247-1256 (2007) - Oscar H. Ibarra, Hsu-Chun Yen:
Preface. Int. J. Found. Comput. Sci. 18(4): 667-668 (2007) - Tseren-Onolt Ishdorj, Ion Petre, Vladimir Rogojin:
Computational Power of intramolecular gene Assembly. Int. J. Found. Comput. Sci. 18(5): 1123-1136 (2007) - Yasuaki Ito, Koji Nakano, Youhei Yamagishi:
Efficient Hardware Algorithms for n Choose k Counters Using the Bitonic Merger. Int. J. Found. Comput. Sci. 18(3): 517-528 (2007) - Jesper Jansson, Zeshan Peng:
Online and Dynamic Recognition of Squarefree Strings. Int. J. Found. Comput. Sci. 18(2): 401-414 (2007) - Tomasz Jurdzinski, Friedrich Otto:
Shrinking Restarting Automata. Int. J. Found. Comput. Sci. 18(2): 361-385 (2007) - Helmut Jürgensen, Pauline Kraak:
Soliton Automata Based on Trees. Int. J. Found. Comput. Sci. 18(6): 1257-1270 (2007) - Lila Kari, Kalpana Mahalingam:
Involutively Bordered Words. Int. J. Found. Comput. Sci. 18(5): 1089-1106 (2007) - Andreas Klein, Martin Kutrib:
Context-Free Grammars with Linked Nonterminals. Int. J. Found. Comput. Sci. 18(6): 1271-1282 (2007) - Manfred Kudlek:
Some Remarks on Quantum Automata. Int. J. Found. Comput. Sci. 18(6): 1283-1292 (2007) - Martin Kutrib, Andreas Malcher:
When Church-Rosser Becomes Context Free. Int. J. Found. Comput. Sci. 18(6): 1293-1302 (2007) - Tobias Lauer, Thomas Ottmann, Amitava Datta:
Update-efficient Data Structures for Dynamic Ip Router Tables. Int. J. Found. Comput. Sci. 18(1): 139-162 (2007)