55 search results - page 5 / 11 » ijfcs 2006 |
IJFCS
2007
13 years 8 months ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
IJFCS
2000
13 years 8 months ago
2000
This work is about an experimental paradigmatic functional language for programming with P-TIME functions. The language is designed from Intuitionistic Light Affine Logic. It can ...
IJFCS
2006
13 years 8 months ago
2006
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits t...
IJFCS
2007
13 years 8 months ago
2007
The basic properties of distributivity and deletion of pure and o-substitution are investigated. The obtained results are applied to show preservation of recognizability in a numb...
IJFCS
2007
13 years 8 months ago
2007
Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints,...