|
Journals in DBLP
- Clelia de Felice, Antonio Restivo
Preface. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:489-492 [Journal]
- Sergey Afonin, Elena Hazova
Membership and Finiteness Problems for Rational Sets of Regular Languages. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:493-506 [Journal]
- Dimitry S. Ananichev, Ilja V. Petrov, Mikhail V. Volkov
Collapsing Words: a Progress Report. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:507-518 [Journal]
- Alexis Bès, Olivier Carton
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:519-542 [Journal]
- Srecko Brlek, Gilbert Labelle, Annie Lacasse
Properties of the Contour Path of Discrete Sets. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:543-556 [Journal]
- Aldo de Luca, Alessandro De Luca
Combinatorial Properties of Sturmian Palindromes. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:557-574 [Journal]
- Thomas Fernique
Multidimensional Sturmian Sequences and Generalized Substitutions. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:575-600 [Journal]
- Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider
Unambiguous Morphic Images of Strings. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:601-628 [Journal]
- Alexander Okhotin
Generalized Lr Parsing Algorithm for Boolean Grammars. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:629-664 [Journal]
- Elena V. Pribavkina
On some Properties of the Language of 2-collapsing Words. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:665-676 [Journal]
- Yung H. Tsin
An Efficient Distributed Algorithm for 3-edge-connectivity. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:677-702 [Journal]
- Daiji Fukagawa, Tatsuya Akutsu
Fast Algorithms for Comparison of Similar Unordered Trees. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:703-729 [Journal]
|