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

Publisher: World Scientific Publishing

Journal 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.

Current impact factor: 0.30

Impact Factor Rankings

2016 Impact Factor Available summer 2017
2014 / 2015 Impact Factor 0.296
2013 Impact Factor 0.326
2012 Impact Factor 0.42
2011 Impact Factor 0.379
2010 Impact Factor 0.459
2009 Impact Factor 0.512
2008 Impact Factor 0.554
2007 Impact Factor 0.656
2006 Impact Factor 0.5

Impact factor over time

Impact factor
Year

Additional details

5-year impact 0.39
Cited half-life 7.80
Immediacy index 0.00
Eigenfactor 0.00
Article influence 0.25
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: During last decades, Cellular Automata (CAs) as bio-inspired parallel computational tools have been proven rather efficient and robust on modeling and simulating many different physical processes and systems and solving scientific problems, in which global behavior arises from the collective effect of simple components that interact locally. Among others of most renowned and well established CA applications, crowd evacuation and pedestrian dynamics are considered ones of the most timely and lively topics. Numerous models and computational paradigms of CAs either as standalone models or coupled with other theoretical and practical modeling approaches have been introduced in literature. All these crowd models are taking advantage of the fact that CA show evidence of a macroscopic nature with microscopic extensions, i.e. they provide adequate details in the description of human behavior and interaction, whilst they retain the computational cost at low levels. In this aspect, several CA models for crowd evacuation focusing on different modeling principles, like potential fields techniques, obstacle avoidance, follow the leader principles, grouping and queuing theory, long memory effects, etc. are presented in this paper. Moreover, having in mind the inherent parallelism of CA and their straightforward implementation in hardware, some anticipative crowd management systems based on CAs are also shown when operating on medium density crowd evacuation for indoor and outdoor environments. Real world cases and different environments were examined proving the efficiency of the proposed CA based anticipative systems. The proposed hardware implementation of the CAs-based crowd simulation models is advantageous in terms of low-cost, high-speed, compactness and portability features. Finally, robot guided evacuation with the help of CAs is also presented. The proposed framework relies on the well established CAs simulation models, while it employs a real-world evacuation implementation assisted by a mobile robotic guide, which in turn guides people towards a less congestive exit at a time.
    No preview · Article · Nov 2015 · International Journal of Foundations of Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: The notion of linear finite transducer (LFT) plays a crucial role in some cryptographic systems. However, as far as we know, no study was ever conducted to count and enu- merate these transducers, which is essential to verify if the size of the key space, of the aforementioned systems, is large enough to prevent an exhaustive search attack. In this work we present a way to estimate the number and percentage of injective equiv- alence classes by introducing a canonical form for LFTs and a procedure to test LFTs equivalence.
    No preview · Article · Nov 2015 · International Journal of Foundations of Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider a restricted variant of the prefix-suffix duplication operation, called bounded prefix-suffix duplication. It consists in the iterative duplication of a length-bounded prefix or suffix of a given word. We give a sufficient condition for the closure of a class of languages under bounded prefix-suffix duplication. Consequently, we get that the class of regular languages is closed under bounded prefix-suffix duplication; furthermore, we propose an algorithm which decides whether a regular language is a finite k-prefix-suffix duplication language. An efficient algorithm solving the membership problem for the k-prefix-suffix duplication of a language is also presented. Finally, we define the k-prefix-suffix duplication distance between two words, extend it to languages and show how it can be computed for regular languages.
    No preview · Article · Nov 2015 · International Journal of Foundations of Computer Science

  • No preview · Article · Nov 2015 · International Journal of Foundations of Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: The Steiner connected dominating set problem is a generalization of the well-known connected dominating set problem, in which only a specified subset of the vertices must be dominated. Finding the Steiner connected dominating set is an NP-hard problem in graph theory, and a new promising approach for multicast routing in wireless ad hoc networks. In this paper, we propose six learning automata-based approximation algorithms for finding a near optimal solution to the minimum Steiner connected dominating set problem. For the first proposed algorithm, it is shown that, by a proper choice of the learning rate of algorithm, the probability of approximating the optimal solution is as close to unity as possible. Moreover, we compute the worst case running time of this algorithm for finding a 1/(1 - ε) optimal solution, and show that, by a proper choice of the learning rate, a trade-off between the running time of algorithm and dominating set size can be made. The last proposed algorithm is compared with the previous well-known algorithms and the results show the superiority of the proposed algorithm both in terms of the dominating set size and running time.
    No preview · Article · Sep 2015 · International Journal of Foundations of Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: In the late nineteen sixties it was observed that the r.e. languages form an infinite proper hierarchy RE1 ∪ RE2 ∪ · · · based on the size of the Turing machines that accept them. We examine the fundamental position of the finite languages and their complements in the hierarchy. We show that for every finite language L one has that L, L¯ ∈ REn for some n ≤ p · (m -⌊log2 p⌋ + 1) + 1 where m is the length of the longest word in L, c is the cardinality of L, and p = min{c, 2m-1}. If L ∈ REn, then L¯ ∈ REs for some s = O(n + m). We also prove that for every n, there is a finite language Ln with m = O(n log2 n) such that Ln 6∈ REn but Ln, L¯n ∈ REs for some s = O(n log2 n). Several further results are shown that how the hierarchy can be separated by increasing chains of finite languages. The proofs make use of several auxiliary results for Turing machines with advice.
    No preview · Article · Sep 2015 · International Journal of Foundations of Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: Several factors have to be taken into account in the design of large interconnection networks. Optimal design is important both to achieve good performance and to reduce the cost of construction and maintenance. Practical communication networks are exposed to failures of network components. Failures between nodes and connections happen and it is desirable that a network is robust in the sense that a limited number of failures does not break down the whole system. Robustness of the network topology is a key aspect in the design of computer networks. A variety of measures have been proposed in the literature to quantify the robustness of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. In this paper, we study the vulnerability of interconnection networks to the failure of individual nodes, using a graph-theoretic concept of domination and strong-weak domination numbers of the transformation graph G^{xy+} as a measure of network robustness.
    No preview · Article · Sep 2015 · International Journal of Foundations of Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: Recently, researchers studied the state complexity of boundary - L∗ ∩Lc∗ - of regular languages L motivated from the famous Kuratowski's 14-theorem. Prefix codes - a set of languages - play an important role in several applications. We consider prefix- free regular languages and investigate the state complexity of two operations, L∗ and L∗ ∩Lc∗ for prefix-free regular languages. Based on the unique structural properties of a prefix-free minimal DFA, we compute the precise state complexity of L∗ and L∗ ∩Lc∗. We then present the tight bound over a quaternary alphabet for L∗ and L∗ ∩Lc∗. Our results are smaller than the composition of the state complexity function for individual operations of prefix-free regular languages.
    No preview · Article · Sep 2015 · International Journal of Foundations of Computer Science

  • No preview · Article · Aug 2015 · International Journal of Foundations of Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: In sequence comparison, finding local similarities in given strings is a very important well-known problem. In this work we introduce two local sequence similarity query problems, and present algorithms for them. Our algorithms use a data structure that supports constant time longest common extension queries. This data structure is created only once, and in time linear in the size of the input strings. After this step all subsequent local similarity queries can be answered very fast. Existing algorithms take significantly more time in answering these queries.
    No preview · Article · Aug 2015 · International Journal of Foundations of Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set's complement. The use of symmetric representation is shown to be important when studying the time complexity of algorithms. A symmetric data structure called a flip list is defined, and it is employed for the Clique, Independent Set, and Vertex Cover problems in a case study. The classic reductions among these problems require the complement of either a graph's edge set or a subset of its vertices. Flip lists can be complemented in constant time with no increase in space. When a flip list is used to represent the edge set of a graph, Clique, Independent Set, and Vertex Cover are shown to have identical (and strongly exponential) time complexity when the classical complexity parameter of input length is used. On the other hand, when a flip list is used to represent a set of numbers as input for the Partition problem, an algorithm can be built that retains strongly sub-exponential time complexity. This provides new evidence with respect to which NP- complete problems should be classified as sub-exponential. Symmetric representation has the advantage of space efficiency, at most linear-time and space complement operations, and symmetry in representing sparse and dense sets. These features can have a significant impact on complexity studies.
    No preview · Article · Aug 2015 · International Journal of Foundations of Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: A method for constructing piecewise differentially 4-uniform permutations has been recently introduced by Zha, Hu and Sun. By using this method, we provide two new infinite families of differentially 4-uniform permutations from the known APN functions. The CCZ inequivalence between these constructed functions and the known differentially 4-uniform permutations are also investigated by computation.
    No preview · Article · Aug 2015 · International Journal of Foundations of Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: Group signatures are typically used to authenticate the signer of message while preserving the privacy of the signer. Group signature should be minimized to reduce potential communication overhead. We propose a novel short group signature scheme that generates constant-size group public key and constant-size group signature. The scheme, using pairing-friendly elliptic curves, is efficient in construction. We give the security proof under XDH and ECDL hardness assumptions in the BMW model. Furthermore, we propose two group membership revocation methods which provide revocation information only to verifiers. One revocation method exposes partial private key of revoked users, which requires less revocation information. The other revocation method includes mixed private key information without revealing the real private keys of revoked users. This method is simple in revocation check.
    No preview · Article · Aug 2015 · International Journal of Foundations of Computer Science
  • [Show abstract] [Hide abstract]
    ABSTRACT: We introduce asynchronous variants of the parallel communicating systems of pushdown automata of Csuhaj-Varjú et al. These are obtained by using a response symbol in addition to the usual query symbols. Our main result states that centralized asynchronous parallel communicating systems of pushdown automata of degree n that work in returning mode have exactly the same expressive power as n-head pushdown automata. This holds in the nondeterministic as well as in the deterministic case. In addition, it is shown that the class of binary relations that is computed by centralized asynchronous parallel communicating systems of pushdown automata of degree two that are working in returning mode coincides with the class of pushdown relations.
    No preview · Article · Aug 2015 · International Journal of Foundations of Computer Science