International Journal of Foundations of Computer Science (INT J FOUND COMPUT S )

Publisher: World Scientific Publishing

Description

The International Journal of Foundations of Computer Science publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include: Algebraic theory of computing and formal systems, Analysis and design of algorithms, Automata and formal languages, Categories in computer science, Combinatorics, Complexity theory, Computational biology and DNA computing, Computer theorem proving, Concurrency, Constructive logic, Crytography, Database theory, Logic and semantics of programs, Logic in artificial intelligence, Logic programming, Models of computation, Program verification and synthesis, Proof and specification in computer science, Quantum computing, Theories and models of internet computing, Theory of learning and inductive inference, Theory of parallel and distributed computing, and Type theory.

Impact factor 0.33

  • Hide impact factor history
     
    Impact factor
  • 5-year impact
    0.43
  • Cited half-life
    6.60
  • Immediacy index
    0.01
  • Eigenfactor
    0.00
  • Article influence
    0.37
  • Website
    International Journal of Foundations of Computer Science website
  • Other titles
    International journal of foundations of computer science (Online), Foundations of computer science
  • ISSN
    0129-0541
  • OCLC
    47442835
  • Material type
    Document, Periodical, Internet resource
  • Document type
    Internet Resource, Computer File, Journal / Magazine / Newspaper

Publisher details

World Scientific Publishing

  • Pre-print
    • Author can archive a pre-print version
  • Post-print
    • Author cannot archive a post-print version
  • Restrictions
    • 12 months embargo
  • Conditions
    • Author's pre-print on any website or open access repository
    • Author's post-print on author's personal website, institutional repository, subject repository or funding agency designated repository
    • Publisher's version/PDF cannot be used
    • Set statement to accompany pre-print and authors post-print - see policy
    • Must link to publisher version with DOI
  • Classification
    ​ yellow

Publications in this journal

  • [Show abstract] [Hide abstract]
    ABSTRACT: Core of a binary word, recently introduced, is a refined way to characterize binary words having the same Parikh matrices, as well as bridging the connection between binary words and partitions of natural numbers. This paper continues the work by generalizing to higher alphabet. The core of a word as well as the relatived version is the essential part of a word that captures the key information of the word from the perspective of its Parikh matrix. Various nice properties of the cores and some interesting results regarding the M-equivalence classes of ternary words are obtained.
    International Journal of Foundations of Computer Science 12/2015;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Looking at the automata defined over a group alphabet as a nearring, we see that they are a highly complicated structure. As with ring theory, one method to deal with complexity is to look at semisimplicity modulo radical structures. We find some bounds on the Jacobson 2-radical and show that in certain groups, this radical can be explicitly found and the semisimple image determined.
    International Journal of Foundations of Computer Science 12/2014; 25(05).
  • International Journal of Foundations of Computer Science 08/2014;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Reducts preserve original classification properties using minimal number of attributes in a table. Dynamic reducts are the most stable reducts in the process of random sampling of original decision table, and they are proposed to classify unseen cases. Classical reduct generation methods can be applied to compute dynamic reducts but the time complexity of computing dynamic reducts are rarely discussed. This paper proposes a cascading hash function, and dynamic reduct can be derived in O(m2n) time with O(mn) space where m and n are total number of attributes and total number of instances of the table. Core of dynamic reducts is also discussed, and the computation of core of dynamic reducts takes O(mn) time with O(mn) space. Sixteen UCI datasets are applied to compute (F, ε)-dynamic reducts for ε = 1, and results are compared to Rough Set Exploration System (RSES). Results show the execution time on generating dynamic reducts using cascading hash tables is faster than RSES up to 1700 times. Besides the efficiency issue of the algorithms, our algorithms are also very easy to implement and applicable to any system.
    International Journal of Foundations of Computer Science 06/2014; 25(02).
  • [Show abstract] [Hide abstract]
    ABSTRACT: We introduce a mathematical framework to describe self-similarity and structural recursion within the active tile self-assembly model, thereby providing a connection between substitution tiling and algorithmic self-assembly. We show that one such structurally recursive assembly system can simulate the dynamics of the self-similar substitution tiling known as the L-shape tiling.
    International Journal of Foundations of Computer Science 06/2014; 25(02).
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present an active tile assembly model which extends Winfree's abstract tile assembly model to tiles that are capable of transmitting and receiving binding site activation signals. We also prove that this model has universal computational power in 2D at temperature 1 by showing an active tile assembly construction that simulates one-dimensional cellular automata in 2D at temperature 1.
    International Journal of Foundations of Computer Science 06/2014; 25(02).
  • [Show abstract] [Hide abstract]
    ABSTRACT: Labs-on-chips are promising candidates for the realization of chemical information systems, where data are embodied in the form of chemical concentrations. In this paper we present the concept of microchemomechanical systems, a lab-on-a-chip technology based on intrinsically active components. The active components are valves fabricated from phase-changeable polymers that provide a direct feedback mechanism and exhibit a transistor-like functionality. Therefore this microfluidic platform facilitates the realization of logic operations, if-then structures and the sampling of chemical signals. In analogy with electronic von Neumann CPUs, control and execution unit are integrated on a single chip. Due to the intrinsic activity of the valves and their small size, microchemomechanical systems are highly suitable for large-scale integration.
    International Journal of Foundations of Computer Science 06/2014; 25(04).
  • [Show abstract] [Hide abstract]
    ABSTRACT: We maintain a balanced parenthesis string under insertions and deletions of parenthesis-pairs in such a way that we can efficiently answer parent queries, i.e., given a parenthesis-pair, we want to find the pair that immediately encloses it. Each parenthesis symbol is attached on a node, and we have n such nodes drawn on a straight line. We achieve O(logn/loglogn) worst-case time per operation on a Pointer Machine, matching the known lower bound on the problem. By transferring our solution to a RAM, we are able to achieve worst case time per update, assuming that we know in advance that the parenthesis-pair to be inserted does not destroy the balance of the parenthesis string.
    International Journal of Foundations of Computer Science 04/2014; 25(01).
  • [Show abstract] [Hide abstract]
    ABSTRACT: Let G be a complete directed graph with n vertices and integer edge weights in range [0,M]. It is well known that an optimal Traveling Salesman Problem (TSP) in G can be solved in 2n time and space (all bounds are given within a polynomial factor of the input length, i.e., poly(n, log M)) and this is still the fastest known algorithm. If we allow a polynomial space only, then the best known algorithm has running time 4nnlog n. For TSP with bounded weights there is an algorithm with 1.657n · M running time. It is a big challenge to develop an algorithm with 2n time and polynomial space. Also, it is well-known that TSP cannot be approximated within any polynomial time computable function unless P=NP. In this short note we propose a very simple algorithm that, for any 0 < ε < 1, finds (1+ε)-approximation to asymmetric TSP in 2nε−1 time and ε−1 · poly(n, log M) space. Thereby, for any fixed ε, the algorithm needs 2n steps and polynomial space to compute (1 + ε)-approximation.
    International Journal of Foundations of Computer Science 04/2014; 25(01).
  • [Show abstract] [Hide abstract]
    ABSTRACT: Identity-based signcryption is a primitive that combines the functions of identity-based encryption and identity-based signature. In this paper, we first attack two of the existing identity-based signcryption schemes which are claimed to be provably secure without random oracles. Then we construct a new identity-based signcryption scheme and proves its security without random oracles.
    International Journal of Foundations of Computer Science 04/2014; 25(01).
  • [Show abstract] [Hide abstract]
    ABSTRACT: Both the post-order heap and the M-heap have a full binary tree structure and have constant amortized insertion and O(logn) deletion time complexities. This paper proposes a simple array version of the M-heap, called AM-heap. The AM-heap has a complete binary tree structure and its array indexing scheme is the same as the simple indexing scheme of the conventional binary heap. An insertion on an AM-heap takes constant amortized time and a deletion takes O(logn) time where n is the number of elements in an AM-heap. The AM-heap resolves the open problem that is to design an array version of the M-heap. Also, it is simpler than the post-order heap to implement and debug.
    International Journal of Foundations of Computer Science 04/2014; 25(01).
  • [Show abstract] [Hide abstract]
    ABSTRACT: We examine the deterministic and nondeterministic state complexity of complements, stars, and reversals of regular languages. Our results are as follows: (1) The nondeterministic state complexity of the complement of an n-state nfa language over a five-letter alphabet may reach each value from log n to 2n. (2) The state complexity of the star (reversal) of an n-state dfa language over a growing alphabet may reach each value from 1 to (from log n to 2n, respectively). (3) The nondeterministic state complexity of the star (reversal) of an n-state nfa binary language may reach each value from 1 to n + 1 (from n - 1 to n + 1, respectively). We also obtain some partial results on the nondeterministic state complexity of complements of binary regular languages. As a bonus, we get an exponential number of values that are non-magic in the binary case.
    International Journal of Foundations of Computer Science 04/2014; 25(01).
  • [Show abstract] [Hide abstract]
    ABSTRACT: A graph G is said to be super edge connected (in short super – λ) if every minimum edge cut isolates a vertex of G. The Kronecker product of graphs G and H is the graph with vertex set V(G × H) = V(G) × V(H), where two vertices (u1, v1) and (u2, v2) are adjacent in G × H if u1u2 ∈ E(G) and v1v2 ∈ E(H). Let G be a connected graph, and let δ(G) and λ(G) be the minimum degree and the edge-connectivity of G, respectively. In this paper we prove that G × Kn is super-λ for n ≥ 3, if λ(G) = δ(G) and G ≇ K2. Furthermore, we show that K2 × Kn is super-λ when n ≥ 4. Similar results for G × Tn are also obtained, where Tn is the graph obtained from Kn by adding a loop to every vertex of Kn.
    International Journal of Foundations of Computer Science 04/2014; 25(01).
  • International Journal of Foundations of Computer Science 04/2014; 25(03):307-329.
  • International Journal of Foundations of Computer Science 04/2014; 25(03):331-342.