scholarly journals On Computational Power of Partially Blind Automata

2012 ◽  
Vol 8 (1) ◽  
pp. 33-41
Author(s):  
Pavol Ďuriš
Keyword(s):  
Finite Automata ◽  
The Other ◽  
Computational Power

On Computational Power of Partially Blind Automata In this paper we deal with 1-way multihead finite automata, in which the symbol under only one head (called read head) controls its move and other heads cannot distinguish the input symbols, they can only distinguish the end-marker from the other input symbols and they are called the blind head. We call such automaton a partially blind multihead automaton. We prove that partially blind k + 1-head finite automata are more powerful than such k-head finite automata. We show also that nondeterministic partially blind k-head finite automata languages are not closed under iteration and intersection for any k ≥ 2, and moreover, deterministic partially blind k head finite automata languages are not closed under intersection, union, complementation and reversal for any k ≥ 2. Finally we prove that deterministic partially blind k-head finite automata with endmarker are more powerful that such automata without endmarker for each k ≥ 4.

scholarly journals Reversible parallel communicating finite automata systems

2021 ◽  
Vol 58 (4) ◽  
pp. 263-279
Author(s):  
Henning Bordihn ◽  
György Vaszil
Keyword(s):  
Finite Automata ◽  
Regular Languages ◽  
The Other ◽  
Deterministic Case ◽  
Computational Power ◽  
Deterministic Finite Automata ◽  
Relationship Of ◽  
The Relationship ◽  
Context Free

AbstractWe 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.

scholarly journals Separable convolutional neural networks for facial expressions recognition

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Andry Chowanda
Keyword(s):  
Neural Networks ◽  
Social Interactions ◽  
Facial Expressions ◽  
Convolutional Neural Networks ◽  
The Other ◽  
Computational Power ◽  
Facial Cues ◽  
Emotional Recognition ◽  
Testing Accuracy ◽  
Facial Expressions Recognition

AbstractSocial interactions are important for us, humans, as social creatures. Emotions play an important part in social interactions. They usually express meanings along with the spoken utterances to the interlocutors. Automatic facial expressions recognition is one technique to automatically capture, recognise, and understand emotions from the interlocutor. Many techniques proposed to increase the accuracy of emotions recognition from facial cues. Architecture such as convolutional neural networks demonstrates promising results for emotions recognition. However, most of the current models of convolutional neural networks require an enormous computational power to train and process emotional recognition. This research aims to build compact networks with depthwise separable layers while also maintaining performance. Three datasets and three other similar architectures were used to be compared with the proposed architecture. The results show that the proposed architecture performed the best among the other architectures. It achieved up to 13% better accuracy and 6–71% smaller and more compact than the other architectures. The best testing accuracy achieved by the architecture was 99.4%.

STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES

2014 ◽  
Vol 25 (08) ◽  
pp. 1141-1159 ◽  
Author(s):  
MARTIN KUTRIB ◽  
ANDREAS MALCHER ◽  
MATTHIAS WENDLANDT
Keyword(s):  
Finite Automata ◽  
The Other ◽  
Other Hand ◽  
Emptiness Problem ◽  
The Cost

Stateless variants of deterministic one-way multi-head finite automata with pebbles, that is, automata where the heads can drop, sense, and pick up pebbles, are studied. The relation between heads and pebbles is investigated, and a proper double hierarchy concerning these two resources is obtained. Moreover, it is shown that a conversion of an arbitrary automaton to a stateless automaton can always be achieved at the cost of additional heads and/or pebbles. On the other hand, there are languages where one head cannot be traded for any number of additional pebbles and vice versa. Finally, the emptiness problem and related problems are shown to be undecidable even for the ‘simplest’ model, namely, for stateless one-way finite automata with two heads and one pebble.

Space-bounded OTMs and REG ∞

Computability ◽  
2021 ◽  
pp. 1-16
Author(s):  
Merlin Carl
Keyword(s):  
Complexity Theory ◽  
Turing Machine ◽  
Finite Automata ◽  
Regular Languages ◽  
The Other ◽  
Deterministic Finite Automata ◽  
Logarithmic Space ◽  
Working Space ◽  
Important Theorem

An important theorem in classical complexity theory is that REG = LOGLOGSPACE, i.e., that languages decidable with double-logarithmic space bound are regular. We consider a transfinite analogue of this theorem. To this end, we introduce deterministic ordinal automata (DOAs) and show that they satisfy many of the basic statements of the theory of deterministic finite automata and regular languages. We then consider languages decidable by an ordinal Turing machine (OTM), introduced by P. Koepke in 2005 and show that if the working space of an OTM is of strictly smaller cardinality than the input length for all sufficiently long inputs, the language so decided is also decidable by a DOA, which is a transfinite analogue of LOGLOGSPACE ⊆ REG; the other direction, however, is easily seen to fail.

Assessing the Utilization of Automata in Representing Players' Behaviors in Game Theory

Game Theory ◽  
2017 ◽  
pp. 106-119
Author(s):  
Khaled Suwais
Keyword(s):  
Game Theory ◽  
Cellular Automata ◽  
Finite Automata ◽  
The State ◽  
The Other ◽  
Direct Impact ◽  
Complex Environments ◽  
Other Hand ◽  
Different Types ◽  
State Of Art

Representing players' strategies in game theory has a direct impact on the players' performance. The state of art shows that automata are one of the primary techniques used for representing players' strategies and behaviors. In this paper, the author will identify different types of automata and assess their utilization in the field of game theory. Is has been found that finite automata, adaptive automata, and cellular automata are widely adopted in game theory. The utilization of finite automata is found to be limited to represent simpler players' behavior. On the other hand, adaptive automata and cellular automata are intensively applied in complex environments, where the number of interacted players is large and therefore, representing complex behaviors are needed.

On IoT and Its Integration With Cloud Computing

2021 ◽  
pp. 37-64
Author(s):  
Iram Abrar ◽  
Sahil Nazir Pottoo ◽  
Faheem Syeed Masoodi ◽  
Alwi Bamhdi
Keyword(s):  
Cloud Computing ◽  
Internet Of Things ◽  
Power Consumption ◽  
Rapid Growth ◽  
Storage Capacity ◽  
The Other ◽  
Computational Power ◽  
New Paradigm ◽  
Other Hand

Internet of things witnessed rapid growth in the last decade and is considered to be a promising field that plays an all-important role in every aspect of modern-day life. However, the growth of IoT is seriously hindered by factors like limited storage, communication capabilities, and computational power. On the other hand, cloud has the potential to support a large amount of data as it has massive storage capacity and can perform complex computations. Considering the tremendous potential of these two technologies and the manner in which they complement one another, they have been integrated to form what is commonly referred to as the cloud of things (CoT). This integration is beneficial as the resulting system is more robust, intelligent, powerful, and offers promising solutions to the users. However, the new paradigm (CoT) is faced with a significant number of challenges that need to be addressed. This chapter discusses in detail various challenges like reliability, latency, scalability, heterogeneity, power consumption, standardization, etc. faced by the cloud of things.

Membership Problem for Two-Dimensional General Row Jumping Finite Automata

2020 ◽  
Vol 31 (04) ◽  
pp. 527-538
Author(s):  
Grzegorz Madejski ◽  
Andrzej Szepietowski
Keyword(s):  
Computational Model ◽  
Turing Machine ◽  
Finite Automaton ◽  
Finite Automata ◽  
The Other ◽  
Membership Problem ◽  
Two Dimensional ◽  
Np Complete ◽  
Nondeterministic Turing Machine ◽  
Membership Problems

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 which segments of the row are read. In this paper, we study the membership problem for these automata. We show that each general row jumping finite automaton can be simulated by a nondeterministic Turing machine with space bounded by the logarithm. This means that the fixed membership problems for such automata are in NL, and so in P. On the other hand, we show that the uniform membership problem is NP-complete.

ON COMPUTATIONAL POWER OF WEIGHTED FINITE AUTOMATA

1996 ◽  
Vol 25 (3,4) ◽  
pp. 285-293 ◽  
Author(s):  
D. Derencourt ◽  
J. Karhumäki ◽  
M. Latteux ◽  
A. Terlutte
Keyword(s):  
Finite Automata ◽  
Computational Power ◽  
Weighted Finite Automata

ON THE POWER OF DETERMINISTIC AND SEQUENTIAL COMMUNICATING P SYSTEMS

2007 ◽  
Vol 18 (02) ◽  
pp. 415-431 ◽  
Author(s):  
LUDĚK CIENCIALA ◽  
LUCIE CIENCIALOVÁ ◽  
PIERLUIGI FRISCO ◽  
PETR SOSÍK
Keyword(s):  
The Other ◽  
P Systems ◽  
Computational Power ◽  
Other Hand ◽  
Mode 2 ◽  
Parallel Mode ◽  
Sequential Mode

We characterize the computational power of several restricted variants of communicating P systems. We show that 2-deterministic communicating P systems with 2 membranes, working in either minimally or maximally parallel mode, are computationally universal. Considering the sequential mode, 2 membranes are shown to characterize the power of partially blind multicounter machines. Next, a characterization of the power of 1-deterministic communicating P systems is given. Finally, we show that the nondeterministic variant in maximally parallel mode is universal already with 1 membrane. These results demonstrate differences in computational power between nondeterminism, 2-determinism and 1-determinism, on one hand, and between sequential, minimally and maximally parallel modes, on the other hand.

Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities

2015 ◽  
Vol 26 (08) ◽  
pp. 1101-1126 ◽  
Author(s):  
Henning Bordihn ◽  
Martin Kutrib ◽  
Andreas Malcher
Keyword(s):  
Finite Automata ◽  
Computational Power ◽  
Deterministic Finite Automata ◽  
Initial States

Systems of deterministic finite automata communicating by sending their states upon request are investigated, when the amount of communication is restricted, that is, when the number of necessary communications during the computations of the system is bounded by a function depending on the length of the input. The computational power and decidability problems are studied for returning systems, where components are set back to their initial states after having answered communication requests. It is proved that an infinite, strict hierarchy of language families exists, induced by the number of messages sent by their most economical acceptors. It is shown that at least one gap in this hierarchy exists. Some levels in the hierarchy are investigated in more detail.

Sign in / Sign up

Export Citation Format

Share Document