R. E. Stearns and J. Hartmanis. Regularity preserving modifications of regular expressions. Information and control, vol. 6 , pp. 55–69 [Book Review]

Journal of Symbolic Logic 31 (2):265 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2269828

Links

PhilArchive



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

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: R. E. Stearns, J. Hartmanis, Regularity Preserving Modifications of Regular Expressions. [REVIEW]Robert McNaughton - 1966 - Journal of Symbolic Logic 31 (2):265-265.
Regularity Preserving Modifications of Regular Expressions.R. E. Stearns & J. Hartmanis - 1966 - Journal of Symbolic Logic 31 (2):265-265.
On the Computational Complexity of Algorithms.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):120-121.
Computational Complexity of Recursive Sequences.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):121-122.
J. Hartmanis, P. M. LewisII, and R. E. Stearns. Classifications of computations by time and memory requirements. Information processing 1965, Proceedings of IFIP Congress 65, organized by the International Federation for Information Processing, New York City, May 24–29,1965, Volume 1, edited by Wayne A. Kalenich, Spartan Books, Inc., Washington, D.C., and Macmillan and Co., Ltd., London, 1965, pp. 31–35. [REVIEW]Jiří Bečvář - 1972 - Journal of Symbolic Logic 37 (3):624.
Review: J. Hartmanis, R. E. Stearns, On the Computational Complexity of Algorithms. [REVIEW]Jiri Becvar - 1967 - Journal of Symbolic Logic 32 (1):120-121.
The case for regularity in mechanistic causal explanation.Holly Andersen - 2012 - Synthese 189 (3):415-432.
Review: J. Hartmanis, R. E. Stearns, Computational Complexity of Recursive Sequences. [REVIEW]Jiri Becvar - 1967 - Journal of Symbolic Logic 32 (1):121-122.
Review: R. E. Stearns, J. Hartmanis, P. M. Lewis, Hierarchies of Memory Limited Computations. [REVIEW]Walter J. Savitch - 1972 - Journal of Symbolic Logic 37 (3):624-625.
J. Hartmanis and R. E. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematical Society, vol. 117 , pp. 285–306. [REVIEW]Jiří Bečvář - 1967 - Journal of Symbolic Logic 32 (1):120-121.
More on regular and decomposable ultrafilters in ZFC.Paolo Lipparini - 2010 - Mathematical Logic Quarterly 56 (4):340-374.
Review: P. M. Lewis, R. E. Stearns, J. Hartmanis, Memory Bounds for Recognition of Context-free and Context-Sensitive Languages. [REVIEW]Walter J. Savitch - 1972 - Journal of Symbolic Logic 37 (3):625-625.
Against Regular and Irregular Characterizations of Mechanisms.Lane DesAutels - 2011 - Philosophy of Science 78 (5):914-925.
Dynamical complexity and regularity.Richard Johns - manuscript
Reviews : Carol Zisowitz Stearns and Peter N. Stearns, Anger: The Struggle for Emotional Control in America's History London : University of Chicago Press, 1986; £21.25; 295 pp. [REVIEW]Ray Holland - 1988 - History of the Human Sciences 1 (1):134-137.

Analytics

Added to PP
2016-06-30

Downloads
16 (#886,588)

6 months
4 (#800,606)

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