NDLI: Cooperating systems of four-dimensional finite automata

Content Provider	Springer Nature Link
Author	Uchida, Yasuo Ito, Takao Sakamoto, Makoto Uchida, Kazuyuki Ide, Takashi Katamune, Ryoju Furutani, Hiroshi Ko, Michio Yoshinaga, Tsunehiro
Copyright Year	2012
Abstract	M. Blum and C. Hewitt first proposed two-dimensional automata as a computational model of two-dimensional pattern processing in 1967, and investigated their pattern recognition abilities. Since then, many researchers in this field have investigated many properties of automata on a two- or three-dimensional tape. However, the question of whether processing four-dimensional digital patterns is much more difficult than processing two- or three-dimensional ones is of great interest from both theoretical and practical standpoints. Thus, the study of four-dimensional automata as a computational model of four-dimensional pattern processing has been meaningful. This article introduces a cooperating system of four-dimensional finite automata as one model of four-dimensional automata. A cooperating system of four-dimensional finite automata consists of a finite number of four-dimensional finite automata and a four-dimensional input tape, where these finite automata work independently (in parallel). The finite automata whose input heads scan the same cell of the input tape can communicate with each other, i.e., every finite automaton is allowed to know the internal states of other finite automata on the cell it is scanning at the moment. In this article we mainly investigate the accepting powers of a cooperating system of seven-way four-dimensional finite automata. The seven-way four-dimensional finite automaton is a four-dimensional finite automaton whose input head can move east, west, south, north, up, down, or in the future, but not in the past, on a four-dimensional input tape.
Starting Page	555
Ending Page	558
Page Count	4
File Format	PDF
ISSN	14335298
Journal	Artificial Life and Robotics
Volume Number	16
Issue Number	4
e-ISSN	16147456
Language	English
Publisher	Springer Japan
Publisher Date	2012-02-22
Publisher Place	Japan
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Computational complexity Cooperating system Finite automaton Four-dimension Multihead Artificial Intelligence (incl. Robotics) Control, Robotics, Mechatronics Computation by Abstract Devices
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Biochemistry, Genetics and Molecular Biology

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Path-bounded three-dimensional finite automata

Hierarchies based on the number of cooperating systems of three-dimensional finite automata

A relationship between Turing machines and finite automata on four-dimensional input tapes

Bottom-up pyramid cellular acceptors with four-dimensional layers

Some properties of four-dimensional multicounter automata

Some properties of four-dimensional parallel Turing machines

Parallel Turing machines on four-dimensional input tapes

Hierarchies Based On the Number of Cooperating Systems of Finite Automata on Four-Dimensional Input Tapes

Three-dimensional parallel Turing machines

Cooperating systems of four-dimensional finite automata

Similar Documents

Path-bounded three-dimensional finite automata

Hierarchies based on the number of cooperating systems of three-dimensional finite automata

A relationship between Turing machines and finite automata on four-dimensional input tapes

Bottom-up pyramid cellular acceptors with four-dimensional layers

Some properties of four-dimensional multicounter automata

Some properties of four-dimensional parallel Turing machines

Parallel Turing machines on four-dimensional input tapes

Hierarchies Based On the Number of Cooperating Systems of Finite Automata on Four-Dimensional Input Tapes

Three-dimensional parallel Turing machines

Cooperating systems of four-dimensional finite automata