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.42
    Show 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 can archive a post-print version
  • Conditions
    • On personal website or institutional repository
    • Publisher's version/PDF cannot be used
    • Set statement to accompany preprint and postprint - see policy
  • Classification
    ​ green

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;
  • [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 derive a quantitative relationship between the maximal entropy rate achieved by a blackbox software system's specification graph, and the probability of faults Pn obtained by testing the system, as a function of the length n of a test sequence. By equating “blackbox” to the maximal entropy principle, we model the specification graph as a Markov chain that, for each distinct value of n, achieves the maximal entropy rate for that n. Hence the Markov transition probability matrices are not constant in n, but form a sequence of transition matrices T1,…, Tn. We prove that, for nontrivial specification graphs, the probability of finding faults goes asymptotically to zero as the test length n increases, regardless of the evolution of Tn. This implies that zero-knowledge testing is practical only for small n. We illustrate the result using a concrete example of a system specification graph for an autopilot control system, and plot its curve Pn.
    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: 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 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: 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).
  • [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: The rupture degree of an incomplete connected graph G is defined by where w(G − S) denotes the number of components in the graph G − S and m(G − S) is the order of the largest component of G − S. This parameter can be used to measure the vulnerability of a graph. In this paper, some bounds consisted of the relationships between the rupture degree and some vulnerability parameters on the rupture degree of a graph are given.
    International Journal of Foundations of Computer Science 04/2014; 24(08).
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper brings together two methods to compositionally verify the generalized non-blocking property, which is a weak liveness property to express the ability of concurrent systems to terminate under given preconditions. Appropriate notions of equivalence and refinement for the generalized nonblocking property are discussed, and abstraction rules to simplify finite-state automata accordingly are presented. The paper also presents a unique canonical automaton representation for all generalized nonblocking equivalent automata, which gives rise to more general means of abstraction and to effective decision procedures for generalized nonblocking equivalence. Experimental results demonstrate how abstraction rules and canonical automata can be combined to model-check large models of concurrent software.
    International Journal of Foundations of Computer Science 04/2014; 24(08).
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers Rh-connectivity of the (n, k)-star graph Sn,k, denoted by κh(Sn,k). In this note, We determine κh(Sn,k) = n+h(k−2)−1 for 2 ≤ k ≤ n−1 and 0 ≤ h ≤ n−k. The results generalize the main result in proved by W. H. Yang et al. [Information Processing Letters, 110(2010), 1007–1011] for the R1-connectivity (κ1(Sn,k)) and R2-connectivity (κ2(Sn,k)).
    International Journal of Foundations of Computer Science 04/2014; 24(08).
  • [Show abstract] [Hide abstract]
    ABSTRACT: It is often a necessity to compare some sequences to find out how similar they are. There are many similarity measures that can be used, e.g., longest common subsequence, edit distance, sequence alignment. Recently a merged longest common subsequence (MergedLCS) problem was formulated with applications in bioinformatics. We propose the bit-parallel algorithms for the MergedLCS problem and evaluate them in practice showing that they are usually tens times faster than the already published methods.
    International Journal of Foundations of Computer Science 04/2014; 24(08).
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present a method for constructing almost perfect nonlinear (APN) functions in odd characteristic by modifying some values of known perfect nonlinear functions. As a consequence, new APN polynomial functions such as ones over 𝔽13 which are CCZ-inequivalent to known APN functions are obtained.
    International Journal of Foundations of Computer Science 04/2014; 24(08).
  • International Journal of Foundations of Computer Science 04/2014; 25(03):331-342.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The quotient complexity of a regular language L, which is the same as its state complexity, is the number of left quotients of L. An atom of a non-empty regular language L with n quotients is a non-empty intersection of the n quotients, which can be uncomplemented or complemented. An NFA is atomic if the right language of every state is a union of atoms. We characterize all reduced atomic NFAs of a given language, i.e., those NFAs that have no equivalent states. We prove that, for any language L with quotient complexity n, the quotient complexity of any atom of L with r complemented quotients has an upper bound of 2n − 1 if r = 0 or r = n; for 1 ≤ r ≤ n − 1 the bound is For each n ≥ 2, we exhibit a language with 2n atoms which meet these bounds.
    International Journal of Foundations of Computer Science 02/2014; 24(07).
  • [Show abstract] [Hide abstract]
    ABSTRACT: Professor Sheng Yu passed away on January 23, 2012, the first day of the Lunar New Year, the Year of the Dragon. He was only sixty-one years old. His death was a tremendous loss to his family, friends, colleagues, co-workers, co-authors, co-editors, members of conference program committees, students, the theoretical Computer Science Community and especially to his beloved wife, Lizhen. Through his teachings, international committee work, seminars and some 150 refereed publications, he left us a huge legacy of many interesting and important research contributions in the areas of the theory and implementation of automata and formal languages, fuzzy logic, object-oriented modeling methodologies, parallel processing for parallel programming languages, important software projects for automata theory research, the creation of the international Conference on Implementation and Application of Automata (CIAA) and a gallery of vivid memories of the wonderful times shared. He is remembered for his enormous energy, competence, diligence, anticipatory thoughtfulness, over-the-top generosity, measured politeness, noble sportsmanship and committed friendship. This paper, an extension of a talk with a similar title at DLT 2012, is an account how we are commemorating Sheng.
    International Journal of Foundations of Computer Science 02/2014; 24(07).
  • [Show abstract] [Hide abstract]
    ABSTRACT: We shall show that (i) there exists a binary NP-complete language such that its unary coded version is in ASPACE(log log n), (ii) if P ≠ NP, there exists a binary language such that its unary version is in ASPACE(log log n), while the language itself is not in ASPACE(log n). As a consequence, under assumption that P ≠ NP, the standard space translation between unary and binary languages does not work for alternating machines with small space; the equivalence is valid only if s(n) ∈ Ω(n). This is quite different from deterministic and nondeterministic machines, for which the corresponding equivalence holds for each s(n) ∈ Ω(log n), and hence for s(log n) ∈ Ω(log log n). Under assumption that NP ≠ co-NP, we also show that binary versions of unary languages in ASPACE(log log n) form a complexity class not contained in NP.
    International Journal of Foundations of Computer Science 02/2014; 24(07).

Related Journals