显示样式： 排序： IF:  GO 导出

Simplifications of Uniform Expressions Specified by Systems Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210714
Florent Koechlin, Cyril Nicaud, Pablo RotondoIn this article, we study the impact of applying simple reduction rules to random syntactic formulas encoded as trees. We assume that there is an operator that has an absorbing pattern and prove that if we use this property to simplify a uniform random expression with n nodes, then the expected size of the result is bounded by a constant. The same holds for higher moments, establishing the lack of

On the Balancedness of TreetoWord Transducers Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210714
Raphaela Löbel, Michael Luttenberger, Helmut SeidlA language over an alphabet B=A∪A¯ of opening (A) and closing (A¯) brackets, is balanced if it is a subset of the Dyck language 𝔻B over B, and it is wellformed if all words are prefixes of words in 𝔻B. We show that wellformedness of a contextfree language is decidable in polynomial time, and that the longest common reduced suffix can be computed in polynomial time. With this at a hand we decide

SublinearTime Language Recognition and Decision by OneDimensional Cellular Automata Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210709
Augusto ModaneseAfter an apparent hiatus of roughly 30 years, we revisit a seemingly neglected subject in the theory of (onedimensional) cellular automata: sublineartime computation. The model considered is that of ACAs, which are language acceptors whose acceptance condition depends on the states of all cells in the automaton. We prove a time hierarchy theorem for sublineartime ACA classes, analyze their intersection

An Inequality for the Number of Periods in a Word Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210621
Daniel Gabric, Narad Rampersad, Jeffrey ShallitWe prove an inequality for the number of periods in a word x in terms of the length of x and its initial critical exponent. Next, we characterize all periods of the lengthn prefix of a characteristic Sturmian word in terms of the lazy Ostrowski representation of n, and use this result to show that our inequality is tight for infinitely many words x. We propose two related measures of periodicity for

The rExtra Diagnosability of Hyper Petersen Graphs Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210423
Shiying WangThe diagnosability of a multiprocessor system or an interconnection network plays an important role in measuring the fault tolerance of the network. In 2016, Zhang et al. proposed a new measure for fault diagnosis of the system, namely, the rextra diagnosability, which restrains that every faultfree component has at least (r+1) faultfree nodes. As a famous topology structure of interconnection networks

Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210605
Lukas Fleischer, Jeffrey ShallitFor a formal language L, the problem of language enumeration asks to compute the lengthlexicographically smallest word in L larger than a given input w∈Σ∗ (henceforth called the Lsuccessor of w). We investigate this problem for regular languages from a computational complexity and state complexity perspective. We first show that if L is recognized by a DFA with n states, then 2Θ(nlogn) states are

Descriptional Complexity of SemiSimple Splicing Systems Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210524
Lila Kari, Timothy NgSplicing systems are generative mechanisms introduced by Tom Head in 1987 to model the biological process of DNA recombination. The computational engine of a splicing system is the “splicing operation”, a cutandpaste binary string operation defined by a set of “splicing rules”, quadruples r=(u1,u2;u3,u4) where u1,u2,u3,u4 are words over an alphabet Σ. For two strings x1u1u2y1 and x2u3u4y2, applying

The (n,k)ModifiedBubbleSort Graph: A Generalized ModifiedBubbleSort Graph Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210524
Mengyue Cao, Tongtong Ding, Min XuIn this paper, we present a new interconnection topology, called the(n,k)modifiedbubblesort graph, which is a generalization of the modifiedbubblesort graph. Additionally, we show many of its properties, such as its hierarchical structure, vertex transitivity, connectivity, edgeconnectivity, super connectivity and super edgeconnectivity. The (n,k)modifiedbubblesort graph presents more flexibility

ErrorFree Affine, Unitary, and Probabilistic OBDDs Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210512
Rishat Ibrahimov, Kamil Khadiev, Krišjānis Prūsis, Abuzer YakaryılmazWe introduce the affine OBDD model and show that zeroerror affine OBDDs can be exponentially narrower than boundederror unitary and probabilistic OBDDs on certain problems. Moreover, we show that LasVegas unitary and probabilistic OBDDs can be quadratically narrower than deterministic OBDDs. We also obtain the same results for the automata counterparts of these models.

Reconstructing Words from RightBoundedBlock Words Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210507
Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel RigoA reconstruction problem of words from scattered factors asks for the minimal information, like multisets of scattered factors of a given length or the number of occurrences of scattered factors from a given set, necessary to uniquely determine a word. We show that a word w∈{a,b}∗ can be reconstructed from the number of occurrences of at most min(wa,wb)+1 scattered factors of the form aib, where

On the Interplay of Direct Topological Factorizations and Cellular Automata Dynamics on BetaShifts Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210507
Johan KopraWe consider the range of possible dynamics of cellular automata (CA) on twosided betashifts Sβ and its relation to direct topological factorizations. We show that any reversible CA F:Sβ→Sβ has an almost equicontinuous direction whenever Sβ is not sofic. This has the corollary that nonsofic betashifts are topologically direct prime, i.e. they are not conjugate to direct topological factorizations

Generalizations of Checking Stack Automata: Characterizations and Hierarchies Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210423
Oscar H. Ibarra, Ian McQuillanWe examine different generalizations of checking stack automata by allowing multiple input heads and multiple stacks, and characterize their computing power in terms of twoway multihead finite automata and spacebounded Turing machines. For various models, we obtain hierarchies in terms of their computing power. Our characterizations and hierarchies expand or tighten some previously known results

Left is Better Than Right for Reducing Nondeterminism of NFAs Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210423
SangKi Ko, YoSub HanWe study the NFA reductions by invariant equivalences and preorders. It is wellknown that the NFA minimization problem is PSPACEcomplete. Therefore, there have been many approaches to reduce the size of NFAs in low polynomial time by computing invariant equivalence or preorder relation and merging the states within same equivalence class. Here we consider the nondeterminism reduction of NFAs by invariant

UnionFreeness Revisited — Between Deterministic and Nondeterministic UnionFree Languages Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210423
Benedek NagyUnionfree expressions are regular expressions without using the union operation. Consequently, (nondeterministic) unionfree languages are described by regular expressions using only concatenation and Kleene star. The language class is also characterised by a special class of finite automata: 1CFPAs have exactly one cyclefree accepting path from each of their states. Obviously such an automaton has

Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210423
Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Reoto Morita, Shinnosuke SekiOritatami is a computational model of RNA cotranscriptional folding, in which an RNA transcript is folding upon itself while being synthesized from its template DNA. This model is known to be Turing universal. Under the restriction on its parameters delay and arity both being 1, however, any deterministically foldable conformation is known to be at most ten times as large as its initial conformation

A Lightweight Key Agreement Protocol with Authentication Capability Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210316
Albert GuanComputationally lightweight and unconditionally secure key agreement protocols are very useful for secure communication in public networks. Recently, Guan et al. proposed a key agreement protocol whose security is based on the unpredictability of channel noise rather than computationally hard problems. These protocols are efficient, computationally lightweight, and unconditionally secure. However,

Generalizations of Code Languages with Marginal Errors Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210222
SangKi Ko, YoSub Han, Kai SalomaaThe kprefixfree, ksuffixfree and kinfixfree languages generalize the prefixfree, suffixfree and infixfree languages by allowing marginal errors. For example, a string x in a kprefixfree language L can be a prefix of up to k different strings in L. We also define finitely prefixfree languages in which a string x can be a prefix of finitely many strings. We present efficient algorithms that

Triple Cyclic Codes Over 𝔽q + u𝔽q Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210104
Ting Yao, Shixin Zhu, Binbin PangLet R=𝔽q+u𝔽q, where q is a power of a prime number p and u2=0. A triple cyclic code of length (r,s,t) over R is a set that can be partitioned into three parts that any cyclic shift of the coordinates of the three parts leaves the code invariant. These codes can be viewed as R[x]submodules of R[x]/〈xr−1〉×R[x]/〈xs−1〉×R[x]/〈xt−1〉. In this paper, we study the generator polynomials and the minimum generating

Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210125
Litao Guo, Mingzu Zhang, Shaohui Zhai, Liqiong XuReliability of interconnection networks is important to design multiprocessor systems. The extra edge connectivity and component edge connectivity are two parameters for the reliability evaluation. The kextra edge connectivity λk(G) is the cardinality of the minimum extra edge cut F such that G−F is not connected and each component of G−F has at least k vertices. The tcomponent edge connectivity

Super Ck and SubCk Connectivity of kAry nCube Networks Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210104
Yuxing YangLet G be an undirected graph. An Hstructurecut (resp. Hsubstructurecut) of G is a set of subgraphs of G, if any, whose deletion disconnects G, where the subgraphs deleted are isomorphic to a certain graph H (resp. where for any T′ of the subgraphs deleted, there is a subgraph T of G, isomorphic to H, such that T′ is a subgraph of T). G is superHMconnected (resp. super subHMconnected) if the

A Proof of Parikh’s Theorem via Dickson’s Lemma Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210113
Toshihiro KogaIn this paper, we give a proof of Parikh’s semilinear theorem via Dickson’s lemma. It is notable that our proof provides a clear separation between properties derived from Dickson’s lemma and tree decomposition for contextfree grammars.

Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210106
Ikhlass Ammar, Yamen El Touati, John Mullins, Moez YeddesThe inclusion problem is one of the common problems in realtime systems. The general form of this problem is undecidable; however, the timebounded verification of inclusion problem is decidable for timed automata. In this study, we propose a new discretization technique to verify the inclusion problem. The proposed technique is applied to a nonZeno timed automaton with an upper bound that does not

A More Reasonable Proof of Cobham’s Theorem Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210130
Thijmen J. P. KrebsWe present a short proof of Cobham’s theorem without using Kronecker’s approximation theorem, making it suitable for generalization beyond automatic sequences.

Graph Orientation with Edge Modifications Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210130
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.The goal of an outdegreeconstrained edgemodification problem is to find a spanning subgraph or supergraph H of an input undirected graph G such that either: (Type I) the number of edges in H is minimized or maximized and H can be oriented to satisfy some specified constraints on the vertices’ resulting outdegrees; or: (Type II) among all subgraphs or supergraphs of G that can be constructed by deleting

Strict Linearizability and Abstract Atomicity Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210106
Tangliu Wen, Jie Peng, Jinyun Xue, Zhen You, Lan SongLinearizability is a commonly accepted consistency condition for concurrent objects. Filipović et al. show that linearizability is equivalent to observational refinement. However, linearizability does not permit concurrent objects to share memory spaces with their client programs. We show that linearizability (or observational refinement) can be broken even though a client program of an object accesses

Remarks on kClique, kIndependent Set and 2Contamination in Complementary Prisms Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210106
Priscila P. Camargo, Uéverton S. Souza, Julliano R. NascimentoComplementary prism graphs arise from the disjoint union of a graph G and its complement Ḡ by adding the edges of a perfect matching joining pairs of corresponding vertices of G and Ḡ. Classical graph problems such as Clique and Independent Set were proved to be NPcomplete on such a class of graphs. In this work, we study the complexity of both problems on complementary prism graphs from the parameterized

Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210106
Chunfang Li, Shangwei Lin, Shengjia LiIn this paper, we study the faulttolerant capability of hypercubes with respect to the hamiltonian property based on the concept of forbidden faulty sets. We show, with the assumption that each vertex is incident with at least three faultfree edges, that an ndimensional hypercube contains a faultfree hamiltonian cycle, even if there are up to (4n−13) edge faults. Moreover, we give an example to

Cryptanalysis of CramerShoup Like Cryptosystems Based on Index Exchangeable Family Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210106
Jinhui Liu, Yong Yu, Bo Yang, Jianwei Jia, Qiqi LaiThe CramerShoup (CS) like cryptosystem based on index exchangeable family (IEF) construction is a novel scheme introduced in Asiaccs 2016 by Li et al. Its versatility was illustrated by building two public key encryption (PKE) schemes, a cramershoup encryption scheme based on IEFs, as well as an outsourcing technique based on nonabelian analog. However, the two schemes are not secure over the recommended

Recognizing Generating Subgraphs Revisited Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210205
Vadim E. Levit, David TankusA graph G is wellcovered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is wwellcovered if all maximal independent sets are of the same weight. For every graph G, the set of weight functions w such that G is wwellcovered is a vector space, denoted as WCW(G). Deciding whether an input graph G is wellcovered is

Random Regular Expression Over Huge Alphabets Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210206
Cyril Nicaud, Pablo RotondoIn this article, we study some properties of random regular expressions of size n, when the cardinality of the alphabet also depends on n. For this, we revisit and improve the classical Transfer Theorem from the field of analytic combinatorics. This provides precise estimations for the number of regular expressions, the probability of recognizing the empty word and the expected number of Kleene stars

ZeroAvoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210206
Stavros Konstantinidis, Mitja Mastnak, Juraj ŠebejWe consider the problem of partitioning effectively a given irreflexive (and possibly symmetric) rational relation R into two asymmetric rational relations. This problem is motivated by a recent method of embedding an Rindependent language into one that is maximal Rindependent, where the method requires to use an asymmetric partition of R. We solve the problem when R is lengthseparable, which means

Further Remarks on the Operational Nonterminal Complexity Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210130
Jürgen DassowFor a regular language L, let Var(L) be the minimal number of nonterminals necessary to generate L by right linear grammars. Moreover, for natural numbers k1,k2,…,kn and an nary regularity preserving operation f, let the range gfVar(k1,k2,…,kn) be the set of all numbers k such that there are regular languages L1,L2,…,Ln with Var(Li)=ki for 1≤i≤n and Var(f(L1,L2,…,Ln))=k. We show that, for the circular

(n − 2)FaultTolerant EdgePancyclicity of Crossed Cubes CQn Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210125
Xirong Xu, Huifeng Zhang, Ziming Wang, Qiang Zhang, Peng ZhangAs one of the most fundamental networks for parallel and distributed computation, cycle is suitable for developing simple algorithms with low communication cost. A graph G is called kfaulttolerant edgepancyclic if after deleting any faulty set F of k vertices and/or edges from G, every correct edge in the resulting graph lies in a cycle of every length from g to V(G−F), inclusively, where g is

Regular Expressions and Transducers Over AlphabetInvariant and UserDefined Labels Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201228
Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua YoungWe are interested in regular expressions and transducers that represent word relations in an alphabetinvariant way — for example, the set of all word pairs u,v where v is a prefix of u independently of what the alphabet is. Current software systems of formal language objects do not have a mechanism to define such objects. We define transducers in which transition labels involve what we call set specifications

Boosting Reversible Pushdown and Queue Machines by Preprocessing Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201215
Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias WendlandtIt is well known that reversible finite automata do not accept all regular languages, that reversible pushdown automata do not accept all deterministic contextfree languages, and that reversible queue automata are less powerful than deterministic realtime queue automata. It is of significant interest from both a practical and theoretical point of view to close these gaps. We here extend these reversible

The BottomUp Position Tree Automaton and the Father Automaton Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201228
Samira Attou, Ludovic Mignot, Djelloul ZiadiThe conversion of a given regular tree expression into a tree automaton has been widely studied. However, classical interpretations are based upon a topdown interpretation of tree automata. In this paper, we propose new constructions based on Gluskov’s one and on the one by Ilie and Yu using a bottomup interpretation. One of the main goals of this technique is to consider as a next step the links

A New Hierarchy for Automaton Semigroups Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210106
Laurent Bartholdi, Thibault Godin, Ines Klimann, Camille Noûs, Matthieu PicantinWe define a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the stateactivity growth. This hierarchy extends that given by Sidki for automaton groups, and also gives new insights into the latter. Its exponential part coincides with a notion of entropy for some associated automata. We prove that the Order Problem is decidable

Synchronizing AlmostGroup Automata Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201215
Mikhail V. Berlinkov, Cyril NicaudIn this paper we address the question of synchronizing random automata in the critical settings of almostgroup automata. Group automata are automata where all letters act as permutations on the set of states, and they are not synchronizing (unless they have one state). In almostgroup automata, one of the letters acts as a permutation on n−1 states, and the others as permutations. We prove that this

State Complexity of Overlap Assembly Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201215
Janusz A. Brzozowski, Lila Kari, Bai Li, Marek SzykułaThe state complexity of a regular language Lm is the number m of states in a minimal deterministic finite automaton (DFA) accepting Lm. The state complexity of a regularitypreserving binary operation on regular languages is defined as the maximal state complexity of the result of the operation where the two operands range over all languages of state complexities ≤m and ≤n, respectively. We determine

NonSelfEmbedding Grammars, ConstantHeight Pushdown Automata, and Limited Automata Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201228
Bruno Guillon, Giovanni Pighizzini, Luca PrigionieroNonselfembedding grammars are a restriction of contextfree grammars which does not allow to describe recursive structures and, hence, which characterizes only the class of regular languages. A double exponential gap in size from nonselfembedding grammars to deterministic finite automata is known. The same size gap is also known from constantheight pushdown automata and 1limited automata to deterministic

The Ranges of Accepting State Complexities of Languages Resulting from Some Operations Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201230
Michal Hospodár, Markus HolzerWe examine the accepting state complexity, i.e., the minimal number of accepting states of deterministic finite automata for languages resulting from unary and binary operations on languages with accepting state complexity given as a parameter. This is a continuation of the work of [J. Dassow: On the number of accepting states of finite automata, J. Autom., Lang. Comb., 21, 2016]. We solve most of

Semilinearity of Families of Languages Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201228
Oscar H. Ibarra, Ian McQuillanTechniques are developed for creating new and general language families of only semilinear languages, and for showing families only contain semilinear languages. It is shown that for language families ℒ that are semilinear full trios, the smallest full AFL containing ℒ that is also closed under intersection with languages in NCM (where NCM is the family of languages accepted by NFAs augmented with

New Constructions of Codebooks Nearly Meeting the Welch Bound Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201119
Zexia Shi, Lei Sun, FangWei FuOptimal 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

Infinite Families of 2Designs from a Class of Linear Codes Related to DembowskiOstrom Functions Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210118
Rong Wang, Xiaoni Du, Cuiling Fan, Zhihua NiuDue to their important applications to coding theory, cryptography, communications and statistics, combinatorial tdesigns have attracted lots of research interest for decades. The interplay between coding theory and tdesigns started many years ago. It is generally known that tdesigns can be used to derive linear codes over any finite field, and that the supports of all codewords with a fixed weight

Algorithmic Aspects of OuterIndependent Total Roman Domination in Graphs Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210118
Amit Sharma, P. Venkata Subba ReddyFor a simple, undirected graph G, a function h:V(G)→{0,1,2} which satisfies the following conditions is called an outerindependent total Roman dominating function (OITRDF) of G with weight h(V)=∑v∈Vh(v). (C1) For all q∈V with h(q)=0 there exists a vertex r such that qr∈E and h(r)=2, (C2) The induced subgraph with vertex set {p:h(p)≥1} has no isolated vertices and (C3) The induced subgraph with vertex

An Exchanged 3Ary nCube Interconnection Network for Parallel Computation Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210113
Yali Lv, ChengKuan Lin, Guijuan WangThe interconnetion network plays an important role in a parallel system. To avoid the edge number of the interconnect network scaling rapidly with the increase of dimension and achieve a good balance of hardware costs and properties, this paper presents a new interconnection network called exchanged 3ary ncube (E3C). Compared with the 3ary ncube structures, E3C shows better performance in terms

On the Commutative Equivalence of Algebraic Formal Series and Languages Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210113
Arturo Carpi, Flavio D’AlessandroThe problem of the commutative equivalence of contextfree and regular languages is studied. Conditions ensuring that a contextfree language of exponential growth is commutatively equivalent with a regular language are investigated.

Search on a Line by Byzantine Robots Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210113
Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil ShendeWe consider the problem of faulttolerant parallel search on an infinite line by n robots. Starting from the origin, the robots are required to find a target at an unknown location. The robots can move with maximum speed 1 and can communicate wirelessly among themselves. However, among the n robots, there are f robots that exhibit byzantine faults. A faulty robot can fail to report the target even

AgglomerationBased Node Importance Analysis in WheelType Networks Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210113
Zeynep Nihan Berberler, Halil İbrahim Yildirim, Tolga İltüzer, İzzet TunçEvaluating the importance of nodes for complex networks is an important part of invulnerability research. In this paper, node importance analysis is conducted in wheelrelated networks by a method of evaluating node importance by node contraction based on network agglomeration in communication networks. Both degrees and positions of nodes are considered with this method. This method was also proved

Subgraphbased Strong Menger Connectivity of Hypercube and Exchanged Hypercube Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20210106
Yihong Wang, ChengKuan Lin, Shuming Zhou, Tao TianLarge scale multiprocessor systems or multicomputer systems, taking interconnection networks as underlying topologies, have been widely used in the big data era. Fault tolerance is becoming an essential attribute in multiprocessor systems as the number of processors is getting larger. A connected graph G is called strong Menger (edge) connected if, for any two distinct vertices u and v, there are min{dG(u)

Watson–Crick Jumping Finite Automata Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201116
Kalpana Mahalingam, Ujjwal Kumar Mishra, Rama RaghavanWatson–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 1limited, No state,

Symbol Separation in Double Occurrence Words Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201110
Nataša Jonoska, Masahico Saito, Hwee Kim, Brad MostowskiA 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

The Noninclusive Diagnosability of Hypercubes under the MM* Model Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201126
Tongtong Ding, Min Xu, Qiang ZhuDiagnosability is an important factor in multipleprocessor systems defined as the maximum number of faulty nodes that a system can recognize. In this paper, we propose a new form of diagnosability called noninclusive diagnosability that requires all faulty sets to be noninclusive. Furthermore, we study the noninclusive diagnosability of hypercubes under the MM* model for n≥1.

Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201110
Parikshit Saikia, Sushanta KarmakarThe 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

Efficient Identification of Node Importance Based on Agglomeration in CycleRelated Networks Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201116
Aysun Asena Kunt, Zeynep Nihan BerberlerThe 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

Additive Number Theory via Approximation by Regular Languages Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201010
Jason Bell, Thomas F. Lidbetter, Jeffrey ShallitWe 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 base2 representation has an equal number of 0’s and 1’s.

Weak Cost Register Automata are Still Powerful Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201022
Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. PérezWe 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 zerotests. We deduce that a number of problems pertaining to that model are undecidable, namely equivalence, upperboundedness, and semilinearity

A Pattern Logic for Automata with Outputs Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201005
Emmanuel Filiot, Nicolas Mazzocchi, JeanFrançois RaskinWe 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 sumautomata) and instantiate the generic logic for each of them. We

Projection for Büchi Tree Automata with Constraints between Siblings Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201005
Patrick Landwehr, Christof LödingWe 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

The Synchronizing Probability Function for Primitive Sets of Matrices Int. J. Found. Comput. Sci. (IF 0.416) Pub Date : 20201010
Costanza Catalano, Raphaël M. JungersMotivated 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 zerorows nor zerocolumns. We formulate the primitivity process in the setting of a twoplayer probabilistic game and we make use of convex optimization