World Scientific
  • Search
  •   
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.
International Journal of Foundations of Computer Science cover

Volume 16, Issue 06 (December 2005)

Special Issue: Prague Stringology Conference
No Access
FOREWORD
  • Pages:1071–1073

https://doi.org/10.1142/S0129054105003650

Special Issue: Prague Stringology Conference
No Access
THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
  • Pages:1075–1097

https://doi.org/10.1142/S0129054105003662

Special Issue: Prague Stringology Conference
No Access
ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
  • Pages:1099–1109

https://doi.org/10.1142/S0129054105003674

Special Issue: Prague Stringology Conference
No Access
A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES
  • Pages:1111–1119

https://doi.org/10.1142/S0129054105003686

Special Issue: Prague Stringology Conference
No Access
BDD-BASED ANALYSIS OF GAPPED q-GRAM FILTERS
  • Pages:1121–1134

https://doi.org/10.1142/S0129054105003698

Special Issue: Prague Stringology Conference
No Access
SORTING SUFFIXES OF TWO-PATTERN STRINGS
  • Pages:1135–1144

https://doi.org/10.1142/S0129054105003704

Special Issue: Prague Stringology Conference
No Access
A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
  • Pages:1145–1154

https://doi.org/10.1142/S0129054105003716

Special Issue: Prague Stringology Conference
No Access
A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
  • Pages:1155–1166

https://doi.org/10.1142/S0129054105003728

Special Issue: Prague Stringology Conference
No Access
SEMI-LOSSLESS TEXT COMPRESSION
  • Pages:1167–1178

https://doi.org/10.1142/S012905410500373X

Special Issue: Prague Stringology Conference
No Access
COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES
  • Pages:1179–1191

https://doi.org/10.1142/S0129054105003741

Special Issue: Prague Stringology Conference
No Access
A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT
  • Pages:1193–1206

https://doi.org/10.1142/S0129054105003753

Special Issue: Prague Stringology Conference
No Access
ARITHMETIC CODING IN PARALLEL
  • Pages:1207–1217

https://doi.org/10.1142/S0129054105003765

Regular Papers
No Access
CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM
  • Pages:1219–1230

https://doi.org/10.1142/S0129054105003777

Regular Papers
No Access
ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS
  • Pages:1231–1251

https://doi.org/10.1142/S0129054105003789

Regular Papers
No Access
ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON
  • Pages:1253–1266

https://doi.org/10.1142/S0129054105003790

Regular Papers
No Access
COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
  • Pages:1267–1295

https://doi.org/10.1142/S0129054105003807

Regular Papers
No Access
NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES
  • Pages:1297–1308

https://doi.org/10.1142/S0129054105003819