Article

Free access

Iterative tree automata, alternating Turing machines, and uniform Boolean circuits: relationships and characterization

Authors:

Abdelaziz Fellah,

Sheng YuAuthors Info & Claims

SAC '92: Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's

Pages 1159 - 1166

https://doi.org/10.1145/130069.130144

Published: 01 March 1992 Publication History

PDF eReader

References

[1]

Borodin, A., "On Relating Time and Space to Size and Depth", SIAM J. Comput., 6, no. 4, pp. 733-743, 1985.

Crossref

Google Scholar

[2]

Cha~ndra, A.K., Kozen, D.C., and Stockmeyer, L.J., "Alternation", JACM., 28, pp. 114-133, 1981.

Digital Library

Google Scholar

[3]

Chang, J.H., Ibarra, O.H., and Jiang, T., "On Iterative and Cellular Tree Arrays", Y. ~omput. S!tstem Sci., 39, pp. 452-473, 1989.

Digital Library

Google Scholar

[4]

Chang, J.H., Ibarra, O.H., and Palis, M.A., "Efficient Simulations of Simple Models of Parallel Computation by Time-bounded ATMs and Space-bounded TMs", Computer Science Department, University of Minnesota, Tech. Rep. TR 85-47, 1985.

Google Scholar

[5]

Cole, S.N., "Real-time Computation by n-dimensional Itetative Arrays of Finite-state Machines", IEEE Trans. on Comput., vol. C-18, no.4, pp. 349-365. 1969.

Google Scholar

[6]

Culik II, K., Ibarra, O.H., and Yu, S., "Iterative Tree Arrays with Logarithmic Depth", Intern. Y. Computer Math., 20, pp. 187-204, 1986.

Crossref

Google Scholar

[7]

Culik II, K., and Yu, S., "Iterative Tree Automata~, Theoret. Comput. Sci., 32, pp. 227-247, 1984.

Crossref

Google Scholar

[8]

Dymond, P.W., and Tompa W., "Speedups of Deterministic Machines by Synchronous Parallel Machines", J. oI Gomput. Sys. Sci., 30, no. 2, pp. 149-161, 1985.

Crossref

Google Scholar

[9]

Fellah, A., Alternating Finite Automata and Related problems, Ph.D. Dissertation, Kent State University, Kent, 1991.

Digital Library

Google Scholar

[10]

Gualil, Z., and Paul, W.J., "An Efficient General- Purpose Parallel, Computer", JACM., 30, no. 2, pp. 360-387, 1983.

Digital Library

Google Scholar

[11]

Hopcroft, J.E., and Ullman, J.D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.

Digital Library

Google Scholar

[12]

Ibarra, O.H., and Palls, M.A., "Some Results Concerning Linear Iterative (Systolic) Arrays", J. Parallel and Distributed Computing, 2, pp. 182-218, 1985.

Crossref

Google Scholar

[13]

Paul, W. J., Prauss, E.J., and Reischuck, R., "On AI- ternation', Acta inform., 14, pp. 243-255, 1980.

Google Scholar

[14]

Ruzzo, W. L., "On Uniform Circuit Complexity", J. Comput. Syst. Sci., 22, pp. 365-383, 1981.

Crossref

Google Scholar

[15]

Seiferas, J.I., "Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays", SIAM J. Comput., 6, no. 3, pp. 487-504, 1977.

Crossref

Google Scholar

[16]

Seiferas, J.I., "Iterative Arrays with Direct Central Control", Acta Inform., vol. 8, no. 2, pp. 177-192, 1977.

Crossref

Google Scholar

[17]

Trahan, J.L., "Simulations among Multidimensional Iterative Arrays, Iterative Tree Automata, and Alternating Turing Machines", University of Illinois, Coordinated Science Laboratory, Tech. Rep. Uilu-Eng-86-2202 Act-66, 1986.

Google Scholar

Cited By

View all

Modanese AWorsch T(2016)Shrinking and Expanding Cellular AutomataCellular Automata and Discrete Complex Systems10.1007/978-3-319-39300-1_13(159-169)Online publication date: 2-Jun-2016
https://doi.org/10.1007/978-3-319-39300-1_13
Worsch T(2002)Cellular Automata with Dynamically Reconfigurable BusesSOFSEM’99: Theory and Practice of Informatics10.1007/3-540-47849-3_37(488-496)Online publication date: 19-Apr-2002
https://doi.org/10.1007/3-540-47849-3_37

Index Terms

Iterative tree automata, alternating Turing machines, and uniform Boolean circuits: relationships and characterization
1. Theory of computation
  1. Logic
  2. Models of computation

Recommendations

Pebble alternating tree-walking automata and their recognizing power

Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that tree languages recognized by these devices are exactly the regular tree languages. We strengthen this by proving the same result for ...
Alternating finite automata and related problems
Sublogarithmic Space-Bounded Multi-Inkdot Alternating Turing Machines with Only Existential (Universal) States

This paper investigates the accepting powers of two-way alternating Turing machines (2ATM's) with only existential (universal) states which have inkdots and sublogarithmic space. It is shown that for sublogarithmic space-bounded computations, (i) multi-...

Comments

Information & Contributors

Information

Published In

SAC '92: Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's

March 1992

1296 pages

ISBN:089791502X

DOI:10.1145/130069

Editors:
Hal Berghel
Univ. of Arkansas, Fayetteville
,
George Hedrick
Oklahoma State Univ., Stillwater
,
Ed Deaton
San Diego State Univ., San Diego, CA
,
David Roach
Univ. of Arkansas, Fayetteville
,
Roger Wainwright
Univ. of Tulsa, Tulsa, OK

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SAC92

Sponsor:

SIGAPP

SAC92: 1992 ACM/SIGAPP Symposium on Applied Computing

Missouri, Kansas City, USA

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
384
Total Downloads

Downloads (Last 12 months)50
Downloads (Last 6 weeks)4

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Modanese AWorsch T(2016)Shrinking and Expanding Cellular AutomataCellular Automata and Discrete Complex Systems10.1007/978-3-319-39300-1_13(159-169)Online publication date: 2-Jun-2016
https://doi.org/10.1007/978-3-319-39300-1_13
Worsch T(2002)Cellular Automata with Dynamically Reconfigurable BusesSOFSEM’99: Theory and Practice of Informatics10.1007/3-540-47849-3_37(488-496)Online publication date: 19-Apr-2002
https://doi.org/10.1007/3-540-47849-3_37

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Pebble alternating tree-walking automata and their recognizing power

Alternating finite automata and related problems

Sublogarithmic Space-Bounded Multi-Inkdot Alternating Turing Machines with Only Existential (Universal) States