Acta Informatica最新文献

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, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.

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 ({{,mathrm{Var},}}(L_i)=k_i) for (1le ile n) and ({{,mathrm{Var},}}(f(L_1,L_2,ldots , L_n))=k). We completely determine the sets (g_f^{{{,mathrm{Var},}}}) for the operations reversal, Kleene-closures (+) and (*), and union; and we give partial results for product and intersection.

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 stl-det-ORRWW-automata, and we show that each regular language is accepted by such a reversible stl-det-ORRWW-automaton. We study the descriptional complexity of these automata, showing that they are exponentially more succinct than nondeterministic finite-state acceptors. We also look at the case of unary input alphabets.

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 the distribution of the local rules in the system may drastically change the dynamics. We prove that if the available local rules are such that every periodic distribution of the rules leads to nilpotent behavior then so do also all eventually periodic distributions. However, in some cases there may be non-periodic distributions that are not nilpotent even if all periodic distributions are nilpotent. We demonstrate such a possibility using aperiodic Wang tile sets. We also investigate temporally periodic points in NUCA. In contrast to classical uniform cellular automata, there are NUCA—even reversible equicontinuous ones—that do not have any temporally periodic points. We prove the undecidability of this property: there is no algorithm to determine if a NUCA with a given finite distribution of local rules has a periodic point.

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. In this paper, we propose algorithms for automatic responses to natural language queries about an image. Our approach uses a predefined neural net for detection of bounding boxes and objects in images, spatial relations between bounding boxes are modeled with a neural net, the queries are analyzed with a syntactic parser, and algorithms to map natural language to properties in the images are introduced. The algorithms make use of semantic similarity and antonyms. We evaluate the performance of our approach with test users assessing the quality of our system’s generated answers.

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 that the number of active states of both finite automata and regular languages is computable, even with respect to nondeterministic finite automata. We further compare the number of active states to related measures for regular languages. In particular, we show incomparability to the radius of regular languages and that the difference between the number of active states and the total number of states needed in finite automata for a regular language can be of exponential order.

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 (eds) Proceedings of the VI international workshop on parallel processing by cellular automata and arrays, Akademie, Berlin, 1994) and Berthiaume et al. (Theoret Comput Sci 320:213–228, 2004) that there exists no 4-state FSSP solution in arrays and rings. The number four is the state lower bound in the class of FSSP protocols. Umeo et al. (Parallel Process Lett 19(2):299–313, 2009), by introducing a concept of full versus partial FSSP solutions, provided a list of the smallest 4-state symmetric powers-of-2 FSSP protocols that can synchronize any one-dimensional (1D) ring cellular automata of length (n=2^{k}) for any positive integer (k ge 1). Afterwards, Ng (in: Partial solutions for the firing squad synchronization problem on rings, ProQuest Publications, Ann Arbor, MI, 2011) also added a list of asymmetric FSSP partial solutions, thus completing the 4-state powers-of-2 FSSP partial solutions. A question whether there are any 4-state partial solutions for ring lengths other than powers-of-2 has remained open. In this paper, we answer the question by providing a new class of the smallest symmetric and asymmetric 4-state FSSP protocols that can synchronize any 1D ring of length (n=2^{k}-1) for any positive integer (k ge 2). We show that the class includes a rich variety of FSSP protocols that consists of 39 symmetric and 132 asymmetric solutions, ranging from minimum to linear synchronization time. In addition, we make an investigation into several interesting properties of those partial solutions, such as swapping general states, transposed protocols, a duality property between them, and an inclusive property of powers-of-2 solutions.