S.-Y. Kuroda. Classes of languages and linear-bounded automata. Information and control, vol. 7 , pp. 207–223

Journal of Symbolic Logic 32 (1):116-117 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271266

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

Review: S.-Y. Kuroda, Classes of Languages and Linear-Bounded Automata. [REVIEW]Peter S. Landweber - 1967 - Journal of Symbolic Logic 32 (1):116-117.
Restorations of punctured languages and similarity of languages.Gerhard Lischke - 2006 - Mathematical Logic Quarterly 52 (1):20-28.
M. P. Schützenberger. On the definition of a family of automata. Information and control, vol. 4 (1961), pp. 245–270. - M. P. Schützenberger. Finite counting automata.Information and control, vol. 5 (1962), pp. 91–107. - M. P. Schützenberger. Certain elementary families of automata. Proceedings of the Symposium of Mathematical Theory of Automata, New York, N.Y., Microwave Research Symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, New York1963, pp. 139–153. [REVIEW]Michael O. Rabin - 1969 - Journal of Symbolic Logic 34 (2):296-297.
Finite automata, real time processes and counting problems in bounded arithmetics.Mirosław Kutyłowski - 1988 - Journal of Symbolic Logic 53 (1):243-258.
Basic Properties of Quantum Automata.Stanley Gudder - 2000 - Foundations of Physics 30 (2):301-319.
Sheila A. Greibach. The undecidability of the ambiguity problem for minimal linear grammars. Information and control, vol. 6 , pp. 119–125. [REVIEW]S.-Y. Kuroda - 1967 - Journal of Symbolic Logic 32 (1):114-115.
Linear logic automata.Max I. Kanovich - 1996 - Annals of Pure and Applied Logic 78 (1-3):147-188.
M. P. Schützenberger. On context-free languages and push-down automata. Information and control, vol. 6 (1963), pp. 246–264. [REVIEW]Michael O. Rabin - 1969 - Journal of Symbolic Logic 34 (2):297-298.
Automata for Epistemic Temporal Logic with Synchronous Communication.Swarup Mohalik & R. Ramanujam - 2010 - Journal of Logic, Language and Information 19 (4):451-484.
Relating word and tree automata.Orna Kupferman, Shmuel Safra & Moshe Y. Vardi - 2006 - Annals of Pure and Applied Logic 138 (1):126-146.
Bounded iteration and unary functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
Some Properties of Iterated Languages.Shane Steinert-Threlkeld - 2016 - Journal of Logic, Language and Information 25 (2):191-213.
The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length.Wesley Calvert - 2005 - Journal of Symbolic Logic 70 (1):331 - 345.
Signalling In Languages With Imperfect Information.Gabriel Sandu - 2001 - Synthese 127 (1-2):21-34.
Automata on ordinals and automaticity of linear orders.Philipp Schlicht & Frank Stephan - 2013 - Annals of Pure and Applied Logic 164 (5):523-527.

Analytics

Added to PP
2016-06-30

Downloads
17 (#838,752)

6 months
5 (#632,353)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references