scholarly journals On the Power of Two-Dimensional Synchronized Alternating Finite Automata1

1991 ◽  
Vol 15 (1) ◽  
pp. 90-98
Author(s):  
Juraj Hromkovič ◽  
Katsushi Inoue ◽  
Akira Ito ◽  
Itsuo Takanami
Keyword(s):  
Finite Automata ◽  
Two Dimensional ◽  
Rectangular Array

It is well known that four-way two-dimensional alternating finite automata are more powerful than three-way two-dimensional alternating finite automata, which are more powerful than two-way two-dimensional alternating finite automata. This paper shows that four-way, three-way, and two-way two-dimensional “synchronized” alternating finite automata all have the same power as rectangular array bounded automata.

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.

scholarly journals DOA Tracking of Two-Dimensional Coherent Distribution Source Based on Fast Approximated Power Iteration

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Tao Wu ◽  
Pengtao Zhang ◽  
Yiwen Li ◽  
Yangjun Gao ◽  
Chaoqi Fu ◽  
...  
Keyword(s):  
Estimation Method ◽  
Doa Estimation ◽  
Distribution Functions ◽  
Tracking Algorithm ◽  
Signal Subspace ◽  
Two Dimensional ◽  
Model Errors ◽  
Rectangular Array ◽  
Linear Arrays ◽  
Power Iteration

Aiming at two-dimensional (2D) coherent distributed (CD) sources, this paper has proposed a direction of arrival (DOA) tracking algorithm based on signal subspace updating under the uniform rectangular array (URA). First, based on the hypothesis of small angular spreads of distributed sources, the rotating invariant relations of the signal subspace of the receive vector of URA are derived. An ESPRIT-like method is constructed for DOA estimation using two adjacent parallel linear arrays of URA. Through the synthesis of estimation by multiple groups of parallel linear arrays within URA arrays, the DOA estimation method for 2D CD sources based on URA is obtained. Then, fast approximated power iteration (FAPI) subspace tracking algorithm is used to update the signal subspace. In this way, DOA tracking of 2D CD sources can be realized by DOA estimation through signal subspace updating. This algorithm has a low computational complexity and good real-time tracking performance. In addition, the algorithm can track multiple CD sources without knowing the angular signal distribution functions, which is robust to model errors.

TWO TOPICS CONCERNING TWO-DIMENSIONAL AUTOMATA OPERATING IN PARALLEL

1992 ◽  
Vol 06 (02n03) ◽  
pp. 211-225 ◽  
Author(s):  
KATSUSHI INOUE ◽  
ITSUO SAKURAMOTO ◽  
MAKOTO SAKAMOTO ◽  
ITSUO TAKANAMI
Keyword(s):  
Turing Machine ◽  
Finite Automata ◽  
Space Complexity ◽  
Two Dimensional ◽  
Turing Machines ◽  
Small Space ◽  
Bottom Up ◽  
Constructible Function ◽  
Deterministic Turing Machine ◽  
Alternating Turing Machines

This paper deals with two topics concerning two-dimensional automata operating in parallel. We first investigate a relationship between the accepting powers of two-dimensional alternating finite automata (2-AFAs) and nondeterministic bottom-up pyramid cellular acceptors (NUPCAs), and show that Ω ( diameter × log diameter ) time is necessary for NUPCAs to simulate 2-AFAs. We then investigate space complexity of two-dimensional alternating Turing machines (2-ATMs) operating in small space, and show that if L (n) is a two-dimensionally space-constructible function such that lim n → ∞ L (n)/ loglog n > 1 and L (n) ≤ log n, and L′ (n) is a function satisfying L′ (n) =o (L(n)), then there exists a set accepted by some strongly L (n) space-bounded two-dimensional deterministic Turing machine, but not accepted by any weakly L′ (n) space-bounded 2-ATM, and thus there exists a rich space hierarchy for weakly S (n) space-bounded 2-ATMs with loglog n ≤ S (n) ≤ log n.

Preface

1997 ◽  
Vol 11 (07) ◽  
pp. 1023-1024
Author(s):  
Serge Miguet ◽  
Annick Montanvert ◽  
P. S. P. Wang
Keyword(s):  
Finite State Machine ◽  
Finite Automata ◽  
Upper Bounds ◽  
Two Dimensional ◽  
Turing Machines ◽  
Closure Properties ◽  
Working Space ◽  
Finite State ◽  
The Individual ◽  
Alternating Turing Machines

Several nonclosure properties of each class of sets accepted by two-dimensional alternating one-marker automata, alternating one-marker automata with only universal states, nondeterministic one-marker automata, deterministic one-marker automata, alternating finite automata, and alternating finite automata with only universal states are shown. To do this, we first establish the upper bounds of the working space used by "three-way" alternating Turing machines with only universal states to simulate those "four-way" non-storage machines. These bounds provide us a simplified and unified proof method for the whole variants of one-marker and/or alternating finite state machine, without directly analyzing the complex behavior of the individual four-way machine on two-dimensional rectangular input tapes. We also summarize the known closure properties including Boolean closures for all the variants of two-dimensional alternating one-marker automata.

A CHARACTERIZATION OF RECOGNIZABLE PICTURE LANGUAGES

1994 ◽  
Vol 08 (02) ◽  
pp. 501-508 ◽  
Author(s):  
KATSUSHI INOUE ◽  
ITSUO TAKANAMI
Keyword(s):  
Finite Automata ◽  
Two Dimensional ◽  
Open Problems ◽  
Nondeterministic Finite Automata ◽  
Letter Alphabet ◽  
The Family ◽  
On Line ◽  
Picture Languages

This paper first shows that REC, the family of recognizable picture languages in Giammarresi and Restivo,3 is equal to the family of picture languages accepted by two-dimensional on-line tessellation acceptors in Inoue and Nakamura.5 By using this result, we then solve open problems in Giammarresi and Restivo,3 and show that (i) REC is not closed under complementation, and (ii) REC properly contains the family of picture languages accepted by two-dimensional nondeterministic finite automata even over a one letter alphabet.

scholarly journals Two-Dimensional Direction-of-Arrival Estimation of Noncircular Signals in Coprime Planar Array with High Degree of Freedom

2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Haiyun Xu ◽  
Daming Wang ◽  
Size Lin ◽  
Bin Ba ◽  
Yankui Zhang
Keyword(s):  
Covariance Matrix ◽  
Direction Of Arrival ◽  
Low Complexity ◽  
Degree Of Freedom ◽  
Spectral Peak ◽  
Two Dimensional ◽  
Rectangular Array ◽  
Planar Array ◽  
Noncircular Signals ◽  
Peak Search

In estimating the two-dimensional (2D) direction-of-arrival (DOA) using a coprime planar array, there are problems of the limited degree of freedom (DOF) and high complexity caused by the spectral peak search. We utilize the time-domain characteristics of signals and present a high DOF algorithm with low complexity based on the noncircular signals. The paper first analyzes the covariance matrix and ellipse covariance matrix of the received signals, vectorizes these matrices, and then constructs the received data of a virtual uniform rectangular array (URA). 2D spatial smoothing processing is applied to calculate the covariance of the virtual URA. Finally, the paper presents an algorithm using 2D multiple signal classification and an improved algorithm using unitary estimating signal parameters via rotational invariance techniques, where the latter solves the closed-form solutions of DOAs replacing the spectral peak search to reduce the complexity. The simulation experiments demonstrate that the proposed algorithms obtain the high DOF and enable to estimate the underdetermined signals. Furthermore, both two proposed algorithms can acquire the high accuracy.

Two-dimensional finite automata and unacceptable functions

1979 ◽  
Vol 7 (3) ◽  
pp. 207-213 ◽  
Author(s):  
Katsushi Inoue ◽  
Akira Nakamura
Keyword(s):  
Finite Automata ◽  
Two Dimensional
Sign in / Sign up

Export Citation Format

Share Document