当前期刊: International Journal of Foundations of Computer Science Go to current issue    加入关注    本刊投稿指南
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • New Constructions of Codebooks Nearly Meeting the Welch Bound
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-11-19
    Zexia Shi; Lei Sun; Fang-Wei Fu

    Optimal codebooks meeting the Welch bound with equality are desirable in many areas, such as direct spread code division multiple access communications, compressed sensing and so on. However, it is difficult to construct such optimal codebooks. There have been a number of attempts to construct codebooks nearly meeting the Welch bound. In this paper, we introduce a generic construction of codebooks

    更新日期:2020-11-25
  • Watson–Crick Jumping Finite Automata
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-11-16
    Kalpana Mahalingam; Ujjwal Kumar Mishra; Rama Raghavan

    Watson–Crick jumping finite automata work on tapes which are double stranded sequences of symbols similar to that of Watson–Crick automata. The double stranded sequence is scanned in a discontinuous manner. That is, after reading a double stranded string, the automata can jump over some subsequence and continue scanning depending on the rule. Some variants of such automata are 1-limited, No state,

    更新日期:2020-11-17
  • Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-11-16
    Aysun Asena Kunt; Zeynep Nihan Berberler

    The identification of node importance in complex networks is of theoretical and practical significance for improving network robustness and invulnerability. In this paper, the importance of each node is evaluated and important nodes are identified in cycles and related networks by node contraction method based on network agglomeration. This novel method considers both the degree and the position of

    更新日期:2020-11-17
  • Additive Number Theory via Approximation by Regular Languages
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-10-10
    Jason Bell; Thomas F. Lidbetter; Jeffrey Shallit

    We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number >25 is the sum of at most three natural numbers whose base-2 representation has an equal number of 0’s and 1’s.

    更新日期:2020-11-13
  • Weak Cost Register Automata are Still Powerful
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-10-22
    Shaull Almagor; Michaël Cadilhac; Filip Mazowiecki; Guillermo A. Pérez

    We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over ℕ with updates using min and increments. We show that this model can simulate, in some sense, the runs of counter machines with zero-tests. We deduce that a number of problems pertaining to that model are undecidable, namely equivalence, upperboundedness, and semilinearity

    更新日期:2020-11-13
  • A Pattern Logic for Automata with Outputs
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-10-05
    Emmanuel Filiot; Nicolas Mazzocchi; Jean-François Raskin

    We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric. We then consider three particular automata models (finite automata, transducers and automata weighted by integers here called sum-automata) and instantiate the generic logic for each of them. We

    更新日期:2020-11-13
  • Projection for Büchi Tree Automata with Constraints between Siblings
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-10-05
    Patrick Landwehr; Christof Löding

    We consider an extension of tree automata on infinite trees that can use equality and disequality constraints between direct subtrees of a node. Recently, it has been shown that the emptiness problem for these kind of automata with a parity acceptance condition is decidable and that the corresponding class of languages is closed under Boolean operations. In this paper, we show that the class of languages

    更新日期:2020-11-13
  • The Synchronizing Probability Function for Primitive Sets of Matrices
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-10-10
    Costanza Catalano; Raphaël M. Jungers

    Motivated by recent results relating synchronizing DFAs and primitive sets, we tackle the synchronization process and the related longstanding Černý conjecture by studying the primitivity phenomenon for sets of nonnegative matrices having neither zero-rows nor zero-columns. We formulate the primitivity process in the setting of a two-player probabilistic game and we make use of convex optimization

    更新日期:2020-11-13
  • Decidability of Right One-Way Jumping Finite Automata
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-10-19
    Simon Beier; Markus Holzer

    We continue our investigation [S. Beier, M. Holzer: Properties of right one-way jumping finite automata. In Proc. 20th DCFS, LNCS, 2018] on (right) one-way jumping finite automata (ROWJFAs), a variant of jumping automata, which is an automaton model for discontinuous information processing. Here we focus on decision problems for ROWJFAs. It turns out that most problems such as, e.g., emptiness, finiteness

    更新日期:2020-11-13
  • The Intersection Problem for Finite Semigroups
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-11-11
    Lukas Fleischer

    The intersection problem for finite semigroups asks, given a set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. In previous work, it was shown that is problem is PSPACE-complete. We introduce compressibility measures as a useful tool to classify the complexity of the intersection problem for certain classes

    更新日期:2020-11-13
  • From Two-Way Transducers to Regular Function Expressions
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-10-05
    Nicolas Baudru; Pierre-Alain Reynier

    Transducers constitute a fundamental extension of automata. The class of regular word functions has recently emerged as an important class of word-to-word functions, characterized by means of (functional, or unambiguous, or deterministic) two-way transducers, copyless streaming string transducers, and MSO-definable graph transformations. A fundamental result in language theory is Kleene’s Theorem,

    更新日期:2020-11-13
  • Symbol Separation in Double Occurrence Words
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-11-10
    Nataša Jonoska; Masahico Saito; Hwee Kim; Brad Mostowski

    A double occurrence word (DOW) is a word in which every symbol appears exactly twice. We define the symbol separation of a DOW w to be the number of letters between the two copies of a symbol, and the separation of w to be the sum of separations over all symbols in w. We then analyze relationship among size, reducibility and separation of DOWs. Specifically, we provide tight bounds of separations of

    更新日期:2020-11-09
  • Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-11-10
    Parikshit Saikia; Sushanta Karmakar

    The Steiner tree problem is one of the fundamental and classical problems in combinatorial optimization. In this paper we study this problem in the CONGESTED CLIQUE model (CCM) [29] of distributed computing. For the Steiner tree problem in the CCM, we consider that each vertex of the input graph is uniquely mapped to a processor and edges are naturally mapped to the links between the corresponding

    更新日期:2020-11-09
  • A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-08-26
    Andreas Kosmatopoulos; Athanasios Tsakalidis; Kostas Tsichlas

    We investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented rectangles. We propose an algorithm where given a set of n iso-oriented rectangles we report all visible surfaces in O((n+k)logn) time and linear space, where k

    更新日期:2020-09-11
  • Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-08-12
    Juyan Li; Chunguang Ma; Zhen Gu

    Proxy Re-Encryption (PRE) is a cryptographic primitive that allows a proxy to turn an Alice’s ciphertext into a Bob’s ciphertext on the same plaintext. All of the PRE schemes are public key encryption and semantic security. Deterministic Public Key Encryption (D-PKE) provides an alternative to randomized public key encryption in various scenarios where the latter exhibits inherent drawbacks. In this

    更新日期:2020-09-11
  • Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-08-31
    Lianhua Wang; Xiaoni Du

    In this paper, firstly we extend the polynomial quotient modulo an odd prime p to its general case with modulo pr and r≥1. From the new quotient proposed, we define a class of pr+1-periodic binary threshold sequences. Then combining the Legendre symbol and Euler quotient modulo pr together, with the condition of 2p−1≢1(modp2), we present exact values of the linear complexity for p≡±3(mod8), and all

    更新日期:2020-09-11
  • Weak Separation Problem for Tree Languages
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-08-26
    Saeid Alirezazadeh; Khadijeh Alibabaei

    Forest algebras are defined for investigating languages of forests [ordered sequences] of unranked trees, where a node may have more than two [ordered] successors. They consist of two monoids, the horizontal and the vertical, with an action of the vertical monoid on the horizontal monoid, and a complementary axiom of faithfulness. A pseudovariety is a class of finite algebras of a given signature,

    更新日期:2020-09-11
  • Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-08-26
    Ameneh Farhadian

    This paper proves that almost every n-vertex graph has the property that the multiset of its induced subgraphs on 3log2n vertices is sufficient to determine it up to isomorphism. That is, the probability that there exists two n-vertex graphs with the same multiset of 3log2n-vertex induced subgraphs goes to zero as n goes to infinity.

    更新日期:2020-09-11
  • A New Study of Parikh Matrices Restricted to Terms
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-08-12
    Zi Jing Chern; K. G. Subramanian; Azhana Ahmad; Wen Chean Teh

    Parikh matrices as an extension of Parikh vectors are useful tools in arithmetizing words by numbers. This paper presents a further study of Parikh matrices by restricting the corresponding words to terms formed over a signature. Some M-equivalence preserving rewriting rules for such terms are introduced. A characterization of terms that are only M-equivalent to themselves is studied for binary signatures

    更新日期:2020-09-11
  • k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-08-26
    Ömer Eğecioğlu; Elif Saygı; Zülfükar Saygı

    Hypercubes and Fibonacci cubes are classical models for interconnection networks with interesting graph theoretic properties. We consider k-Fibonacci cubes, which we obtain as subgraphs of Fibonacci cubes by eliminating certain edges during the fundamental recursion phase of their construction. These graphs have the same number of vertices as Fibonacci cubes, but their edge sets are determined by a

    更新日期:2020-09-11
  • Efficient Identification of k-Closed Strings
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-08-26
    Hayam Alamro; Mai Alzamel; Costas S. Iliopoulos; Solon P. Pissis; Wing-Kin Sung; Steven Watts

    A closed string contains a proper factor occurring as both a prefix and a suffix but not elsewhere in the string. Closed strings were introduced by Fici (WORDS 2011) as objects of combinatorial interest. This paper addresses a new problem by extending the closed string problem to the k-closed string problem, for which a level of approximation is permitted up to a number of Hamming distance errors,

    更新日期:2020-08-26
  • Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-07-06
    Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Subhas C. Nandy; Suchismita Roy

    Given a convex polygon with n vertices, we study the problem of identifying a triangle with its smallest side as large as possible among all the triangles that can be drawn inside the polygon. We show that at least one of the vertices of such a triangle must coincide with a vertex of the polygon. We also propose an O(n2) time algorithm to compute such a triangle inside the given convex polygon.

    更新日期:2020-07-24
  • On g-Extra Conditional Diagnosability of Twisted Hypercubes under MM∗ Model
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-07-06
    Shunzhe Zhang; Dong Li; Huiqing Liu

    Connectivity and diagnosability are important parameters in measuring the reliability and fault-tolerance of an interconnection network G. The g-extra conditional faulty set F is a faulty vertex set such that every component of G−F has at least g+1 vertices. The g-extra connectivity κg(G) of a connected graph G is the minimum cardinality of a g-extra conditional faulty set F of G such that G−F is disconnected

    更新日期:2020-07-24
  • A Reduction of Integer Factorization to Modular Tetration
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-07-06
    Markus Hittmeir

    Let a,k∈ℕ. By 1a:=a and ka:=ak−1a, we denote the k th iterate of the exponential function x↦ax evaluated at a, also known as tetration. We demonstrate how an algorithm for evaluating tetration modulo natural numbers N could be used to compute the prime factorization of N and provide heuristic arguments for the efficiency of this reduction. Additionally, we prove that the problem of computing the squarefree

    更新日期:2020-07-24
  • Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-07-06
    Ahmet Çevik

    We bring into attention the interplay between model theory of committed graphs (1-regular graphs) and their palindromic characteristic in the domain of formal languages. We prove some model theoretic properties of committed graphs and then give a characterization of them in the formal language domain using palindromes. We show in the first part of the paper that the theory of committed graphs and the

    更新日期:2020-07-24
  • Simplified Bounds on FHSs Set and Its Strictly Optimal Construction
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-06-26
    Shanding Xu; Xiwang Cao; Jiafu Mi; Chunming Tang

    Frequency-hopping sequences (FHSs) with favorite partial Hamming correlation properties are intensively needed in many synchronization and multiple-access systems. Strictly optimal FHS sets are a kind of FHS sets which has optimal Hamming correlation for any correlation window. In this paper, firstly we present simplified representations of the generalized Lempel–Greenberger bound on the partial Hamming

    更新日期:2020-07-24
  • On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-06-26
    Benedek Nagy

    One of the most essential classes of problems related to formal languages is the membership problem (also called word problem), i.e., to decide whether a given input word belongs to the language specified, e.g., by a generative grammar. For context-free languages the problem is solved efficiently by various well-known parsing algorithms. However, there are several important languages that are not context-free

    更新日期:2020-07-24
  • Membership Problem for Two-Dimensional General Row Jumping Finite Automata
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-06-30
    Grzegorz Madejski; Andrzej Szepietowski

    Two-dimensional general row jumping finite automata were recently introduced as an interesting computational model for accepting two-dimensional languages. These automata are nondeterministic. They guess an order in which rows of the input array are read and they jump to the next row only after reading all symbols in the previous row. In each row, they choose, also nondeterministically, an order in

    更新日期:2020-07-24
  • Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-03-06
    Eunkyung Kim; Hyang-Sook Lee; Jeongeun Park

    Multikey fully homomorphic encryption (MFHE) allows homomorphic operations between ciphertexts encrypted under different keys. In applications for secure multiparty computation (MPC) protocols, MFHE can be more advantageous than usual fully homomorphic encryption (FHE) since users do not need to agree with a common public key before the computation when using MFHE. In EUROCRYPT 2016, Mukherjee and

    更新日期:2020-03-06
  • A Unified Method for Private Exponent Attacks on RSA Using Lattices
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-03-06
    Hatem M. Bahig; Dieaa I. Nassr; Ashraf Bhery; Abderrahmane Nitaj

    Let (n=pq,e=nβ) be an RSA public key with private exponent d=nδ, where p and q are large primes of the same bit size. At Eurocrypt 96, Coppersmith presented a polynomial-time algorithm for finding small roots of univariate modular equations based on lattice reduction and then succussed to factorize the RSA modulus. Since then, a series of attacks on the key equation ed−kϕ(n)=1 of RSA have been presented

    更新日期:2020-03-06
  • Constrained k-Center Problem on a Convex Polygon
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-03-06
    Manjanna Basappa; Ramesh K. Jallu; Gautam K. Das

    In this paper, we consider a restricted covering problem, in which a convex polygon P with n vertices and an integer k are given, the objective is to cover the entire region of P using k congruent disks of minimum radius ropt, centered on the boundary of P. For k≥7 and any 𝜖>0, we propose an (1+7k+7𝜖k+𝜖)-factor approximation algorithm for this problem, which runs in O((n+k)(|logropt|+log⌈1𝜖⌉))

    更新日期:2020-03-06
  • Security of Auditing Protocols Against Subversion Attacks
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-03-06
    Jiaxian Lv; Yi Wang; Jinshu Su; Rongmao Chen; Wenjun Wu

    In 2013, the revelation of Edward Snowden rekindled cryptographic researchers’ interest in subversion attacks. Since then, many works have been carried out to explore the power of subversion attacks and feasible effective countermeasures as well. In this work, we investigate the study of subversion attacks against cloud auditing protocol, which has been well-known as useful primitive for secure cloud

    更新日期:2020-03-06
  • CCA-Secure and Revocable Certificateless Encryption with Ciphertext Evolution
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-03-06
    Yinxia Sun; Futai Zhang; Anmin Fu; Zhe Xia

    Certificateless cryptosystems have attracted great interests in cryptographic research since its invention. Because compared with traditional public key cryptosystems or identity-based cryptosystems, they could not only simplify the certificate management, but also alleviate the key escrow problem. In certificateless cryptosystems, user revocation is a challenging issue. To address this issue, one

    更新日期:2020-03-06
  • Communication Performance Evaluation of the Locally Twisted Cube
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-03-06
    Yuejuan Han; Lantao You; Cheng-Kuan Lin; Jianxi Fan

    The topology properties of multi-processors interconnection networks are important to the performance of high performance computers. The hypercube network Qn has been proved to be one of the most popular interconnection networks. The n-dimensional locally twisted cube LTQn is an important variant of Qn. Fault diameter and wide diameter are two communication performance evaluation parameters of a network

    更新日期:2020-03-06
  • Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-03-06
    Tatsuya Akutsu; Avraham A. Melkman; Takeyuki Tamura

    We consider the maximum common connected edge subgraph problem and the maximum common connected induced subgraph problem for simple graphs with labeled vertices (or labeled edges). The former is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs. The latter is to find a common connected induced subgraph with the maximum number

    更新日期:2020-03-06
  • On the Prefix–Suffix Duplication Reduction
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-01-29
    Szilárd Zsolt Fazekas; Robert Mercaş; Daniel Reidenbach

    This work answers some questions proposed by Bottoni, Labella, and Mitrana (Theoretical Computer Science 682, 2017) regarding the prefix–suffix reduction on words. The operation is defined as a reduction by one half of every square that is present as either a prefix or a suffix of a word, leading thus to a finite set of words associated to the starting one. The iterated case considers consecutive applications

    更新日期:2020-01-29
  • A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-01-29
    Fernando Arroyo Montoro; Sandra Gómez-Canaval; Karina Jiménez Vega; Alfonso Ortega de la Puente

    In this paper we consider a new variant of Networks of Polarized Evolutionary Processors (NPEP) named Generalized Networks of Evolutionary Polarized Processors (GNPEP) and propose them as solvers of combinatorial optimization problems. Unlike the NPEP model, GNPEP uses its numerical evaluation over the processed data from a quantitative perspective, hence this model might be more suitable to solve

    更新日期:2020-01-29
  • Parikh q-Matrices and q-Ambiguous Words
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-01-29
    Somnath Bera; Rodica Ceterchi; Kalpana Mahalingam; K. G. Subramanian

    The Parikh matrix mapping plays an important role in the study of words through numerical properties. The Parikh q-matrix mapping, introduced by Egecioglu and Ibarra (2004) as an extension of the Parikh matrix mapping, maps words to matrices with polynomial entries in q. A word w over an ordered alphabet Σ is said to be q-ambiguous if there exists another word v over Σ such that both the words have

    更新日期:2020-01-29
  • Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-01-29
    Andrei Păun; Florin-Daniel Bîlbîe

    We investigate the spiking neural P systems with communication on request (SNQ P systems) that are devices in the area of neural like P systems abstracting the way in which neurons work and process information. Here we discuss the SNQ P systems using the rule application strategy as defined by Linqiang Pan and collaborators and we are able to improve their result of universality of such systems using

    更新日期:2020-01-29
  • Swarm Intelligence Models: Ant Colony Systems Applied to BNF Grammars Rule Derivation
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-01-29
    Luis Fernando de Mingo López; Nuria Gómez Blas; Angel Luis Castellanos Peñuela; Juan Bautista Castellanos Peñuela

    Ant Colony Systems have been widely employed in optimization issues primarily focused on path finding optimization, such as Traveling Salesman Problem. The main advantage lies in the choice of the edge to be explored, defined using the idea of pheromone. This article proposes the use of Ant Colony Systems to explore a Backus-Naur form grammar whose elements are solutions to a given problem. Similar

    更新日期:2020-01-29
  • Networks of Reaction Systems
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-01-29
    Paolo Bottoni; Anna Labella; Grzegorz Rozenberg

    In this paper, we study the behavior (processes) of reaction systems where the context is not arbitrary, but it has its own structure. In particular, we consider a model where the context for a reaction system originates from a network of reaction systems. Such a network is formalized as a graph with reaction systems residing at its nodes, where each reaction system contributes to defining the context

    更新日期:2020-01-29
  • Closed-Set-Based Discovery of Representative Association Rules
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-01-29
    Cristina Tîrnăucă; José L. Balcázar; Domingo Gómez-Pérez

    The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the “essential” or “representative” rules. A previously known algorithm for mining representative rules relies on an incorrect mathematical claim, and can be seen to miss part of its intended output; in previous work, two of the authors of the present paper

    更新日期:2020-01-29
  • On Compensation Loops in Genomic Duplications
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-01-29
    José M. Sempere

    In this paper, we investigate the compensation loops, a DNA rearrangement in chromosomes due to unequal crossing over. We study the effect of compensation loops over the gene duplication, and we formalize it as a restricted case of gene duplication in general. We study this biological process under the point of view of formal languages, and we provide some results about the languages defined in this

    更新日期:2020-01-29
  • Networks with Evolutionary Processors and Ideals and Codes as Filters
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-01-29
    Jürgen Dassow; Bianca Truthe

    We study how the generative power of networks of evolutionary processors decreases if special codes and ideals are used as input and output filters of the nodes instead of arbitrary regular languages. We show that all recursively enumerable languages can be generated if the filters are right ideals or left ideals. With respect to codes, we obtain a hierarchy of evolutionary language families which

    更新日期:2020-01-29
  • Deterministic Lindenmayer Systems with Dynamic Control of Parallelism
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2020-01-29
    Henning Bordihn; György Vaszil

    M-rate 0L systems are interactionless Lindenmayer systems together with a function assigning to every string a set of multisets of productions that may be applied simultaneously to the string. Some questions that have been left open in the forerunner papers are examined, and the computational power of deterministic M-rate 0L systems is investigated, where also tabled and extended variants are taken

    更新日期:2020-01-29
  • Cobham’s Theorem and Automaticity
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-12-12
    Lucas Mol; Narad Rampersad; Jeffrey Shallit; Manon Stipulanti

    We make certain bounds in Krebs’ proof of Cobham’s theorem explicit and obtain corresponding upper bounds on the length of a common prefix of an aperiodic a-automatic sequence and an aperiodic b-automatic sequence, where a and b are multiplicatively independent. We also show that an automatic sequence cannot have arbitrarily large factors in common with a Sturmian sequence.

    更新日期:2019-12-12
  • Fault-Tolerant Panconnectivity of Augmented Cubes AQn
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-12-12
    Xirong Xu; Huifeng Zhang; Sijia Zhang; Yuansheng Yang

    The augmented cube AQn is a variation of the hypercube Qn. This paper considers the fault-tolerant Panconnectivity of AQn. Assume that F⊆V(AQn)∪E(AQn) and n≥4. We prove that for any two fault-free vertices u and v with distance d in AQn, there exists a fault-free path Puv of each length from max{d+2,4} to 2n−fv−1 in AQn−F if |F|≤2n−4, where fv is the number of faulty vertices in AQn. Moreover, the

    更新日期:2019-12-12
  • On the Construction of Binary Optimal LCD Codes with Short Length
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-12-12
    Qiang Fu; Ruihu Li; Fangwei Fu; Yi Rao

    A q-ary linear code 𝒞 is called a linear complementary dual (LCD) code if it meets its dual trivially. Binary LCD codes play a significant role for their advantage of low complexity for implementations against side-channel attacks and fault injection attacks. In this paper, the problem of finding LCD codes over the binary field is discussed. Many new codes and new bounds are presented, as well as

    更新日期:2019-12-12
  • Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-12-12
    Liqiong Xu; Shuming Zhou; Weihua Yang

    An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processors and communication links, respectively. Connectivity is an important metric for fault tolerance of interconnection networks. A graph G is said to be maximally local-connected if each pair of vertices u and v are connected by min{dG(u),dG(v)} vertex-disjoint paths. In this paper, we show that

    更新日期:2019-12-12
  • An Input/Output Efficient Algorithm for Hessenberg Reduction
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-12-12
    Sraban Kumar Mohanty; G. Sajith

    Reduction of an N×N nonsymmetric matrix to Hessenberg form which takes O(N3) flops and O(N3/B) I/Os is a major performance bottleneck in the computing of its eigenvalues. Usually to improve the performance, this Hessenberg reduction is computed in two steps: the first one reduces the matrix to a banded Hessenberg form, and the second one further reduces it to Hessenberg form by incorporating more matrix-matrix

    更新日期:2019-12-12
  • New Results on Vector and Homing Vector Automata
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-12-12
    Özlem Salehi; Abuzer Yakaryılmaz; A. C. Cem Say

    We present several new results and connections between various extensions of finite automata through the study of vector automata and homing vector automata. We show that homing vector automata outperform extended finite automata when both are defined over 2×2 integer matrices. We study the string separation problem for vector automata and demonstrate that generalized finite automata with rational

    更新日期:2019-12-12
  • Uncountable Realtime Probabilistic Classes
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-12-12
    Maksims Dimitrijevs; Abuzer Yakaryılmaz

    We investigate the minimal cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On non-unary case, we obtain the same result for double logarithmic space, which is also tight. When replacing the work tape with a few counters, we can still achieve similar results for unary

    更新日期:2019-12-12
  • Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-09-19
    Jozef Jirásek, Jr.; Matúš Palmovský; Juraj Šebej

    We study Kuratowski algebras generated by prefix-, suffix-, factor-, and subword-free languages under the operations of star and complementation. We examine 12 possible algebras, and for each of them, we decide whether or not it can be generated by a prefix-, suffix-, factor-, or subword-free language. In each case when an algebra can be generated by such a language, we show that this language can

    更新日期:2019-09-19
  • Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-09-19
    Kitti Gelle; Szabolcs Iván

    Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a characterization exists for Union trees which are constructed without using path compression) for the case assuming union-by-rank strategy for merging. In this

    更新日期:2019-09-19
  • One-Time Nondeterministic Computations
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-09-19
    Markus Holzer; Martin Kutrib

    We introduce the concept of one-time nondeterminism as a new kind of limited nondeterminism for finite state machines and pushdown automata. Roughly speaking, one-time nondeterminism means that at the outset the computation is nondeterministic, but whenever it performs a guess, this guess is fixed for the rest of the computation. We characterize the computational power of one-time nondeterministic

    更新日期:2019-09-19
  • Sets of Pictures Avoiding Overlaps
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-09-19
    Marcella Anselmo; Dora Giammarresi; Maria Madonia

    A string set avoids overlaps if it has the property that the prefix of each string in the set does not coincide with the suffix of any string in the set. The problem of avoiding overlaps in strings is extensively investigated since it plays an important role in the context of string matching and coding. The notion of overlap can be extended naturally to two dimensions; two pictures p and q have an

    更新日期:2019-09-19
  • State Complexity of the Quotient Operation on Input-Driven Pushdown Automata
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-09-19
    Alexander Okhotin; Kai Salomaa

    The quotient of a formal language K by another language L is the set of all strings obtained by taking a string from K that ends with a suffix of a string from L, and removing that suffix. The quotient of a regular language by any language is always regular, whereas the context-free languages and many of their subfamilies, such as the linear and the deterministic languages, are not closed under the

    更新日期:2019-09-19
  • A Parametrized Analysis of Algorithms on Hierarchical Graphs
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-09-19
    Rachel Faran; Orna Kupferman

    Hierarchical graphs are used in order to describe systems with a sequential composition of sub-systems. A hierarchical graph consists of a vector of subgraphs. Vertices in a subgraph may “call” other subgraphs. The reuse of subgraphs, possibly in a nested way, causes hierarchical graphs to be exponentially more succinct than equivalent flat graphs. Early research on hierarchical graphs and the computational

    更新日期:2019-09-19
  • Sensing as a Complexity Measure
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-09-19
    Shaull Almagor; Denis Kuperberg; Orna Kupferman

    The size of deterministic automata required for recognizing regular and ω-regular languages is a well-studied measure for the complexity of languages. We introduce and study a new complexity measure, based on the sensing required for recognizing the language. Intuitively, the sensing cost quantifies the detail in which a random input word has to be read in order to decide its membership in the language

    更新日期:2019-09-19
  • Reset Complexity of Ideal Languages Over a Binary Alphabet
    Int. J. Found. Comput. Sci. (IF 0.523) Pub Date : 2019-09-19
    Marina Maslennikova

    We prove PSPACE-completeness of checking whether a given ideal language serves as the language of reset words for some automaton with at most four states over a binary alphabet. We compare the reset complexity and the state complexity for languages related to slowly synchronizing automata.

    更新日期:2019-09-19
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
施普林格,自然编辑
ERIS期刊投稿
欢迎阅读创刊号
自然职场,为您触达千万科研人才
spring&清华大学出版社
城市可持续发展前沿研究专辑
Springer 纳米技术权威期刊征稿
全球视野覆盖
施普林格·自然新
chemistry
物理学研究前沿热点精选期刊推荐
自然职位线上招聘会
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
ACS Publications填问卷
阿拉丁试剂right
林亮
南方科技大学
朱守非
华东师范大学
胡少伟
有机所林亮
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
上海纽约大学
浙江大学
廖矿标
天合科研
x-mol收录
试剂库存
down
wechat
bug