Decision Problems of Finite Automata Design and Related Arithmetics

Journal of Symbolic Logic 34 (3):509-510 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270940

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Elgot C. C.. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society, vol. 98 , pp. 21–51. [REVIEW]Robert McNaughton - 1969 - Journal of Symbolic Logic 34 (3):509-510.
Review: C. Y. Lee, Automata and Finite Automata. [REVIEW]J. C. Shepherdson - 1971 - Journal of Symbolic Logic 36 (3):534-535.
Finite automata, real time processes and counting problems in bounded arithmetics.Mirosław Kutyłowski - 1988 - Journal of Symbolic Logic 53 (1):243-258.
Decision problems for multiple successor arithmetics.J. W. Thatcher - 1966 - Journal of Symbolic Logic 31 (2):182-190.
John McCarthy and Claude Shannon. Preface. Automata studies, edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton1956, pp. v–viii. - S. C. Kleene. Representations of events in nerve nets and finite automata. Automata studies, edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton1956, pp. 3–41. [REVIEW]W. L. Duda - 1958 - Journal of Symbolic Logic 23 (1):59-60.
A Decision Procedure for Computations of Finite Automata.Joyce Friedman - 1965 - Journal of Symbolic Logic 30 (2):248-249.
Minsky M. L.. Some universal elements for finite automata. Automata studies, edited by Shannon C. E. and McCarthy J., Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton 1956, pp. 117–128. [REVIEW]Patrick C. Fischer - 1970 - Journal of Symbolic Logic 35 (3):481-482.

Analytics

Added to PP
2015-02-05

Downloads
6 (#1,694,337)

6 months
4 (#1,247,093)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Algorithmic uses of the Feferman–Vaught Theorem.J. A. Makowsky - 2004 - Annals of Pure and Applied Logic 126 (1-3):159-213.
Descriptive complexity theories.Joerg Flum - 2003 - Theoria 18 (1):47-58.
On Relation Between Linear Temporal Logic and Quantum Finite Automata.Amandeep Singh Bhatia & Ajay Kumar - 2020 - Journal of Logic, Language and Information 29 (2):109-120.
Descriptive Complexity Theories.Joerg Flum - 2010 - Theoria 18 (1):47-58.

Add more citations

References found in this work

No references found.

Add more references