-
Reachability analysis of linear systems Acta Inform. (IF 0.6) Pub Date : 2024-04-09 Shiping Chen, Xinyu Ge
In this paper, we propose a decision procedure of reachability for a linear system \(\xi '=A\xi +u\), where the matrix \(A's\) eigenvalues can be arbitrary algebraic number and the input u is a vector of trigonometric-exponential polynomials. If the initial set contains only one point, the reachability problem under consideration is reduced to the decidability of the sign of trigonometric-exponential
-
Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking Acta Inform. (IF 0.6) Pub Date : 2024-03-29 Kamaledin Ghiasi-Shirazi, Taraneh Ghandi, Ali Taghizadeh, Ali Rahimi-Baigi
-
Distance-edge-monitoring sets of networks Acta Inform. (IF 0.6) Pub Date : 2024-03-19 Gang Yang, Jiannan Zhou, Changxiang He, Yaping Mao
-
An encoding of the $$\lambda $$ -calculus in the String MultiSet Rewriting calculus Acta Inform. (IF 0.6) Pub Date : 2024-03-13
Abstract In this paper, we present an encoding of the \(\lambda \) -calculus in a multiset rewriting system and provide a few applications of the construction. For this purpose, we choose the calculus named String MultiSet Rewriting, which was introduced in Barbuti et al. (Electron Notes Theor Comput Sci 194:19–34, 2008) by Barbuti et al. With the help of our encoding, we give alternative proofs for
-
Exact distributed quantum algorithm for generalized Simon’s problem Acta Inform. (IF 0.6) Pub Date : 2024-03-10 Hao Li, Daowen Qiu, Le Luo, Paulo Mateus
-
New families of Laplacian borderenergetic graphs Acta Inform. (IF 0.6) Pub Date : 2024-02-26 Cahit Dede
-
Approximating subset sum ratio via partition computations Acta Inform. (IF 0.6) Pub Date : 2024-01-12 Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
-
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications Acta Inform. (IF 0.6) Pub Date : 2023-12-18
Abstract Motivated by the need to convert move-atomic assumption in LOOK-COMPUTE-MOVE (LCM) robot algorithms to be implemented in existing distributed systems, we define a new distributed fundamental task, the neighborhood mutual remainder (NMR). Consider a situation where each process has a set of operations \(O_p\) and executes each operation in \(O_p\) infinitely often in distributed systems. Then
-
n-PS-codes, 2-infix-outfix codes and some related classes of codes Acta Inform. (IF 0.6) Pub Date : 2023-12-15
Abstract In this paper, n-PS-codes, 2-infix-outfix codes and some related classes of codes are investigated where \(n\ge 1\) . The classes of n-PS-codes and 2-infix-outfix codes are generalizations of classes of prefix codes and suffix codes, and infix codes and outfix codes, respectively. The closure properties of n-PS-codes and g-3-PS-codes under composition are discussed where \(n\ge 1\) , and the
-
Balancing m-ary search trees with compressions on the fringe Acta Inform. (IF 0.6) Pub Date : 2023-12-15 Shuyang Gao, Leen Hatem, Hosam Mahmoud
-
A decision procedure for string constraints with string/integer conversion and flat regular constraints Acta Inform. (IF 0.6) Pub Date : 2023-10-24 Hao Wu, Yu-Fang Chen, Zhilin Wu, Bican Xia, Naijun Zhan
-
Discovering workflow nets of concurrent iterative processes Acta Inform. (IF 0.6) Pub Date : 2023-09-14 Tonatiuh Tapia-Flores, Ernesto López-Mellado
-
The second step in characterizing a three-word code Acta Inform. (IF 0.6) Pub Date : 2023-09-08 Chunhua Cao, Jiao Xu, Lei Liao, Di Yang, Guichuan Jia, Qian Du
-
On first-order runtime enforcement of branching-time properties Acta Inform. (IF 0.6) Pub Date : 2023-08-03 Luca Aceto, Ian Cassar, Adrian Francalanza, Anna Ingólfsdóttir
-
Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms Acta Inform. (IF 0.6) Pub Date : 2023-08-01 Farnaz Sheikhi, Behnam Zeraatkar, Sama Hanaie
-
Testing membership for timed automata Acta Inform. (IF 0.6) Pub Date : 2023-07-17 Richard Lassaigne, Michel de Rougemont
-
Simple chain automaton random number generator for IoT devices Acta Inform. (IF 0.6) Pub Date : 2023-06-08 Pál Dömösi, Géza Horváth, Norbert Tihanyi
-
Constrained polynomial zonotopes Acta Inform. (IF 0.6) Pub Date : 2023-05-05 Niklas Kochdumper, Matthias Althoff
-
On the undecidability and descriptional complexity of synchronized regular expressions Acta Inform. (IF 0.6) Pub Date : 2023-04-10 Jingnan Xie, Harry B. Hunt
In Freydenberger (Theory Comput Syst 53(2):159–193, 2013. https://doi.org/10.1007/s00224-012-9389-0), Freydenberger shows that the set of invalid computations of an extended Turing machine can be recognized by a synchronized regular expression [as defined in Della Penna et al. (Acta Informatica 39(1):31–70, 2003. https://doi.org/10.1007/s00236-002-0099-y)]. Therefore, the widely discussed predicate
-
Toward a theory of program repair Acta Inform. (IF 0.6) Pub Date : 2023-03-27 Besma Khaireddine, Aleksandr Zakharchenko, Matias Martinez, Ali Mili
-
On partial information retrieval: the unconstrained 100 prisoner problem Acta Inform. (IF 0.6) Pub Date : 2022-12-30 Ivano Lodato, Snehal M. Shekatkar, Tian An Wong
-
Decentralized runtime verification of message sequences in message-based systems Acta Inform. (IF 0.6) Pub Date : 2022-10-10 Mahboubeh Samadi, Fatemeh Ghassemi, Ramtin Khosravi
-
Exploration of k-edge-deficient temporal graphs Acta Inform. (IF 0.6) Pub Date : 2022-08-27 Thomas Erlebach, Jakob T. Spooner
-
Properties of graphs specified by a regular language Acta Inform. (IF 0.6) Pub Date : 2022-08-12 Volker Diekert, Henning Fernau, Petra Wolf
-
On the decidability of finding a positive ILP-instance in a regular set of ILP-instances Acta Inform. (IF 0.6) Pub Date : 2022-08-04 Petra Wolf
-
Pushdown automata and constant height: decidability and bounds Acta Inform. (IF 0.6) Pub Date : 2022-07-27 Giovanni Pighizzini, Luca Prigioniero
-
The regular languages of wire linear AC $$^0$$ 0 Acta Inform. (IF 0.6) Pub Date : 2022-07-25 Michaël Cadilhac, Charles Paperman
-
Reoptimization of parameterized problems Acta Inform. (IF 0.6) Pub Date : 2022-07-25 Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith
-
Careful synchronization of partial deterministic finite automata Acta Inform. (IF 0.6) Pub Date : 2022-07-22 Hanan Shabana, M. V. Volkov
-
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times Acta Inform. (IF 0.6) Pub Date : 2022-07-19 Asaf Levin, Tal Shusterman
-
Operational complexity and pumping lemmas Acta Inform. (IF 0.6) Pub Date : 2022-07-20 Jürgen Dassow, Ismaël Jecker
The well-known pumping lemma for regular languages states that, for any regular language L, there is a constant p (depending on L) such that the following holds: If \(w\in L\) and \(\vert w\vert \ge p\), then there are words \(x\in V^{*}\), \(y\in V^+\), and \(z\in V^{*}\) such that \(w=xyz\) and \(xy^tz\in L\) for \(t\ge 0\). The minimal pumping constant \({{{\,\mathrm{mpc}\,}}(L)}\) of L is the minimal
-
Alternating complexity of counting first-order logic for the subword order Acta Inform. (IF 0.6) Pub Date : 2022-06-26 Dietrich Kuske, Christian Schwarz
This paper considers the structure consisting of the set of all words over a given alphabet together with the subword relation, regular predicates, and constants for every word. We are interested in the counting extension of first-order logic by threshold counting quantifiers. The main result shows that the two-variable fragment of this logic can be decided in twofold exponential alternating time with
-
Lamplighter groups and automata Acta Inform. (IF 0.6) Pub Date : 2022-06-08 Sanjay Jain, Birzhan Moldagaliyev, Frank Stephan, Tien Dat Tran
This paper investigates presentations of lamplighter groups using computational models from automata theory. The present work shows that if G can be presented such that the full group operation is recognised by a transducer, then the same is true for the lamplighter group \(G \wr {{\mathbb {Z}}}\) of G. Furthermore, Cayley presentations, where only multiplications with constants are recognised by transducers
-
Depth-first search in directed planar graphs, revisited Acta Inform. (IF 0.6) Pub Date : 2022-06-04 Eric Allender, Archit Chauhan, Samir Datta
-
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs Acta Inform. (IF 0.6) Pub Date : 2022-04-20 Shlomi Dolev, Yin Li
-
Reactive bisimulation semantics for a process algebra with timeouts Acta Inform. (IF 0.6) Pub Date : 2022-04-08 Rob van Glabbeek
-
Translation validation of coloured Petri net models of programs on integers Acta Inform. (IF 0.6) Pub Date : 2022-04-06 Soumyadip Bandyopadhyay,Dipankar Sarkar,Chittaranjan Mandal,Holger Giese
-
From regular expression matching to parsing Acta Inform. (IF 0.6) Pub Date : 2022-03-30 Philip Bille, Inge Li Gørtz
-
$$\mathcal {L}$$ L -reduction computation revisited Acta Inform. (IF 0.6) Pub Date : 2022-03-24 Kaoru Fujioka, Fumiya Okubo, Takashi Yokomori
Let K and L be two languages over \(\Sigma \) and \(\Gamma \) (with \(\Gamma \subset \Sigma \)), respectively. Then, the L-reduction of K, denoted by \(K\%\,L\), is defined by \(\{ u_0u_1\cdots u_n \in (\Sigma - \Gamma )^* \mid u_0v_1u_1 \cdots v_nu_n \in K, \ v_i \in L \ (1\le i \le n) \}\). This is extended to language classes as follows: \({\mathcal {K}}\% {\mathcal {L}}=\{K\%L \mid K \in {\mathcal
-
Minimum status of trees with a given degree sequence Acta Inform. (IF 0.6) Pub Date : 2022-02-17 Haiyan Guo, Bo Zhou
The minimum status (or its normalized version called proximity) is a well-known concept in communication network theory. We determine the trees minimizing the minimum status among trees with a given degree sequence, and we show that the trees maximizing the minimum status among trees with a given degree sequence must be caterpillars with specific properties.
-
On Huang and Wong’s algorithm for generalized binary split trees Acta Inform. (IF 0.6) Pub Date : 2022-02-14 Marek Chrobak, Mordecai Golin, J. Ian Munro, Neal E. Young
Huang and Wong (Acta Inform 21(1):113–123, 1984) proposed a polynomial-time dynamic-programming algorithm for computing optimal generalized binary split trees. We show that their algorithm is incorrect. Thus, it remains open whether such trees can be computed in polynomial time. Spuler (Optimal search trees using two-way key comparisons, PhD thesis, 1994) proposed modifying Huang and Wong’s algorithm
-
A jumping $$5'\rightarrow 3'$$ 5 ′ → 3 ′ Watson–Crick finite automata model Acta Inform. (IF 0.6) Pub Date : 2022-01-24 Radim Kocman, Zbyněk Křivka, Alexander Meduna, Benedek Nagy
Jumping finite automata and sensing \(5'\rightarrow 3'\) Watson–Crick finite automata are finite-state models of computation which allow to process the input word not only in the strictly left-to-right manner. In this paper a new combined model of them is presented. The accepting power of the new model is studied and compared with the original models and also other well-known language families. Furthermore
-
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction Acta Inform. (IF 0.6) Pub Date : 2022-01-21 Marcin Michalak
Biclustering is a two-dimensional data analysis technique that, applied to a matrix, searches for a subset of rows and columns that intersect to produce a submatrix with given, expected features. Such an approach requires different methods to those of typical classification or regression tasks. In recent years it has become possible to express biclustering goals in the form of Boolean reasoning. This
-
Improved complement for two-way alternating automata Acta Inform. (IF 0.6) Pub Date : 2022-01-21 Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok
For each two-way alternating finite automaton (a fa) A with s states, we directly build a a fa \(A^c \) with \(O(s^6)\) states which accepts exactly those inputs that are not accepted by A. This improves upon the previously best-known construction, which was both more expensive and more complicated, as it required \(O(s^7)\) states and involved building and simulating an intermediate linear-bounded
-
Index appearance record with preorders Acta Inform. (IF 0.6) Pub Date : 2021-12-30 Křetínský, Jan, Meggendorfer, Tobias, Waldmann, Clara, Weininger, Maximilian
Transforming \(\omega \)-automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and show that our method produces significantly smaller automata than previous approaches.
-
Correction to: Reactive synthesis without regret Acta Inform. (IF 0.6) Pub Date : 2021-10-20 Paul Hunter,Guillermo A. Pérez,Jean-François Raskin
-
Correction to: Sound reasoning in tock-CSP Acta Inform. (IF 0.6) Pub Date : 2021-10-15 James Baxter,Pedro Ribeiro,Ana Cavalcanti
-
Interface Automata for Shared Memory Acta Inform. (IF 0.6) Pub Date : 2021-08-30 Schinko, Ayleen, Vogler, Walter, Gareis, Johannes, Nguyen, N. Tri, Lüttgen, Gerald
Interface theories based on Interface Automata (IA) are formalisms for the component-based specification of concurrent systems. Extensions of their basic synchronization mechanism permit the modelling of data, but are studied in more complex settings involving modal transition systems or do not abstract from internal computation. In this article, we show how de Alfaro and Henzinger’s original IA theory
-
Regular numeral systems for data structures Acta Inform. (IF 0.6) Pub Date : 2021-07-25 Amr Elmasry, Jyrki Katajainen
We formalize several regular numeral systems, state their properties and supported operations, clarify the correctness, and tabulate the proofs. Our goal is to use as few symbols in the presentation of digits and make as few digit changes as possible in every operation. Most importantly, we introduce two new systems: (1) the buffered regular system is simple and allows the increment and decrement of
-
Reversibility for stateless ordered RRWW-automata Acta Inform. (IF 0.6) Pub Date : 2021-07-19 Friedrich Otto, Matthias Wendlandt
There are two types of stateless deterministic ordered restarting automata that both characterize the class of regular languages: the stl-det-ORWW-automaton and the stl-det-ORRWW-automaton. For the former a notion of reversibility has been introduced and studied that is very much tuned to the way in which restarting automata work. Here we suggest another, more classical, notion of reversibility for
-
Reversible parallel communicating finite automata systems Acta Inform. (IF 0.6) Pub Date : 2021-07-19 Henning Bordihn, György Vaszil
We study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components
-
On the size of partial derivatives and the word membership problem Acta Inform. (IF 0.6) Pub Date : 2021-07-19 Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
Partial derivatives are widely used to convert regular expressions to nondeterministic automata. For the word membership problem, it is not strictly necessary to build an automaton. In this paper, we study the size of partial derivatives on the average case. For expressions in strong star normal form, we show that on average and asymptotically the largest partial derivative is at most half the size
-
A new class of the smallest FSSP partial solutions for 1D rings of length $$n=2^{k}-1$$ n = 2 k - 1 Acta Inform. (IF 0.6) Pub Date : 2021-07-19 Hiroshi Umeo, Naoki Kamikawa, Gen Fujita
A synchronization problem in cellular automata has been known as the Firing Squad Synchronization Problem (FSSP), where the FSSP gives a finite-state protocol for synchronizing a large scale of cellular automata. A quest for smaller state FSSP solutions has been an interesting problem for a long time. It has been shown by Balzer (Inf Control 10:22–42, 1967), Sanders (in: Jesshope, Jossifov, Wilhelmi
-
On the number of active states in finite automata Acta Inform. (IF 0.6) Pub Date : 2021-07-19 Henning Bordihn, Markus Holzer
We introduce a new measure of descriptional complexity on finite automata, called the number of active states. Roughly speaking, the number of active states of an automaton A on input w counts the number of different states visited during the most economic computation of the automaton A for the word w. This concept generalizes to finite automata and regular languages in a straightforward way. We show
-
An instruction set for reversible Turing machines Acta Inform. (IF 0.6) Pub Date : 2021-07-19 Kenichi Morita
A reversible Turing machine (RTM) is a standard model of reversible computing that reflects physical reversibility. So far, to describe an RTM the quadruple formulation and the quintuple formulation have been used. In this paper, we propose the program form as a new formulation for RTMs. There, an RTM is described by a sequence of only five kinds of instructions. It is shown that any RTM in the quintuple
-
Natural language guided object retrieval in images Acta Inform. (IF 0.6) Pub Date : 2021-07-19 Ahmad Ostovar, Suna Bensch, Thomas Hellström
The ability to understand the surrounding environment and being able to communicate with interacting humans are important functionalities for many automated systems where visual input (e.g., images, video) and natural language input (speech or text) have to be related to each other. Possible applications are automatic image caption generation, interactive surveillance systems, or human robot interaction
-
A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds Acta Inform. (IF 0.6) Pub Date : 2021-07-19 Thomas Worsch
In cellular automata with multiple speeds for each cell i there is a positive integer \(p_i\) such that this cell updates its state still periodically but only at times which are a multiple of \(p_i\). Additionally there is a finite upper bound on all \(p_i\). Manzoni and Umeo have described an algorithm for these (one-dimensional) cellular automata which solves the Firing Squad Synchronization Problem
-
The descriptional power of queue automata of constant length Acta Inform. (IF 0.6) Pub Date : 2021-07-19 Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano
We consider the notion of a constant length queue automaton—i.e., a traditional queue automaton with a built-in constant limit on the length of its queue—as a formalism for representing regular languages. We show that the descriptional power of constant length queue automata greatly outperforms that of traditional finite state automata, of constant height pushdown automata, and of straight line programs
-
Nilpotency and periodic points in non-uniform cellular automata Acta Inform. (IF 0.6) Pub Date : 2021-07-19 Supreeti Kamilya, Jarkko Kari
Nilpotent cellular automata have the simplest possible dynamics: all initial configurations lead in bounded time into the unique fixed point of the system. We investigate nilpotency in the setup of one-dimensional non-uniform cellular automata (NUCA) where different cells may use different local rules. There are infinitely many cells in NUCA but only a finite number of different local rules. Changing
-
Operational complexity and right linear grammars Acta Inform. (IF 0.6) Pub Date : 2021-07-19 Jürgen Dassow
For a regular language L, let \({{\,\mathrm{Var}\,}}(L)\) be the minimal number of nonterminals necessary to generate L by right linear grammars. Moreover, for natural numbers \(k_1,k_2,\ldots ,k_n\) and an n-ary regularity preserving operation f, let \(g_f^{{{\,\mathrm{Var}\,}}}(k_1,k_2,\ldots ,k_n)\) be the set of all numbers k such that there are regular languages \(L_1,L_2,\ldots , L_n\) such that