Search results for 'Automata Theory' (try it on Scholar)

1000+ found
Order:
  1.  7
    Alessandro Bisio, Giacomo Mauro D’Ariano, Paolo Perinotti & Alessandro Tosini (2015). Free Quantum Field Theory From Quantum Cellular Automata. Foundations of Physics 45 (10):1137-1152.
    After leading to a new axiomatic derivation of quantum theory, the new informational paradigm is entering the domain of quantum field theory, suggesting a quantum automata framework that can be regarded as an extension of quantum field theory to including an hypothetical Planck scale, and with the usual quantum field theory recovered in the relativistic limit of small wave-vectors. Being derived from simple principles, the automata theory is quantum ab-initio, and does not assume (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  2.  10
    Dennis P. Waters (2012). Von Neumann's Theory of Self-Reproducing Automata: A Useful Framework for Biosemiotics? Biosemiotics 5 (1):5-15.
    As interpreted by Pattee, von Neumann’s Theory of Self-Reproducing Automata has proved to be a useful tool for understanding some of the difficulties and paradoxes of molecular biosemiotics. But is its utility limited to molecular systems or is it more generally applicable within biosemiotics? One way of answering that question is to look at the Theory as a model for one particular high-level biosemiotic activity, human language. If the model is not useful for language, then it certainly (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  3. R. Ramanujam (2012). Memory and Logic: A Tale From Automata Theory. Journal of the Indian Council of Philosophical Research 1.
     
    Export citation  
     
    My bibliography  
  4. Mark H. Bickhard (1982). Automata Theory, Artificial Intelligence and Genetic Epistemology. Revue Internationale de Philosophie 36 (4):549.
     
    Export citation  
     
    My bibliography   1 citation  
  5. Dana Scott (1975). Some Definitional Suggestions for Automata Theory. Journal of Symbolic Logic 40 (4):615-616.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  6.  1
    Dirk Siefkes (1972). Review: J. W. Thatcher, J. B. Wright, Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic. [REVIEW] Journal of Symbolic Logic 37 (3):619-620.
  7.  1
    Stephen A. Cook (1971). Review: Jiri Becvar, Real-Time and Complexity Problems in Automata Theory. [REVIEW] Journal of Symbolic Logic 36 (2):346-346.
    Direct download  
     
    Export citation  
     
    My bibliography  
  8. Robert F. Barnes (1975). Review: Dana Scott, Some Definitional Suggestions for Automata Theory. [REVIEW] Journal of Symbolic Logic 40 (4):615-616.
    Direct download  
     
    Export citation  
     
    My bibliography  
  9. Robert F. Barnes (1975). Scott Dana. Some Definitional Suggestions for Automata Theory. Journal of Computer and System Sciences, Vol. 1 , Pp. 187–212. [REVIEW] Journal of Symbolic Logic 40 (4):615-616.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  10. Stephen A. Cook (1971). Bečvář Jiří. Real-Time and Complexity Problems in Automata Theory. English with Czech Summary. Kybernetika , Vol. 1 , Pp. 475–498. [REVIEW] Journal of Symbolic Logic 36 (2):346.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  11. Dennis F. Cudia (1974). Hartmanis J. And Lewis F. D.. The Use of Lists in the Study of Undecidable Problems in Automata Theory. Journal of Computer and System Sciences, Vol. 5 , Pp. 54–66. [REVIEW] Journal of Symbolic Logic 39 (2):347.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12. Dennis F. Cudia (1974). Review: J. Hartmanis, F. D. Lewis, The Use of Lists in the Study of Undecidable Problems in Automata Theory. [REVIEW] Journal of Symbolic Logic 39 (2):347-347.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  13. Jill Humphries (1973). Automata Theory as a Model of Biological Replication, Adaptation and Evolution. Dissertation, University of Waterloo (Canada)
     
    Export citation  
     
    My bibliography  
  14. Jean-Éric Pin (2011). J. Sakarovitch, Elements of Automata Theory. Bulletin of Symbolic Logic 17 (1):122.
  15. Jonathan P. Seldin (1975). Böhm Corrado and Gross Wolf. Introduction to the CUCH. Automata Theory, Edited by Caianiello E. R., Academic Press, New York and London 1966, Pp. 35–65. Reprinted in Pubblicazioni dell'Istituto Nazionale Per le Applicazioni Del Calcolo, Ser. 11 No. 669, Rome 1966.Böhm C.. The CUCH as a Formal and Description Language. Formal Language Description Languages for Computer Programming, Proceedings of the IFIP Working Conference on Formal Language Description Languages, Edited by Steel T. B. Jr., North-Holland Publishing Company, Amsterdam 1966, Pp. 179–197. [REVIEW] Journal of Symbolic Logic 40 (1):81-83.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16. Dirk Siefkes (1972). Thatcher J. W. And Wright J. B.. Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic. Mathematical Systems Theory, Vol. 2 , Pp. 57–81. [REVIEW] Journal of Symbolic Logic 37 (3):619-620.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  17.  27
    Raymond J. Nelson (1975). Behaviorism, Finite Automata, and Stimulus-Response Theory. Theory and Decision 6 (August):249-67.
    In this paper it is argued that certain stimulus-response learning models which are adequate to represent finite automata (acceptors) are not adequate to represent noninitial state input-output automata (transducers). This circumstance suggests the question whether or not the behavior of animals if satisfactorily modelled by automata is predictive. It is argued in partial answer that there are automata which can be explained in the sense that their transition and output functions can be described (roughly, Hempel-type covering (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  18.  38
    K. Svozil (1998). Analogues of Quantum Complementarity in the Theory of Automata. Studies in History and Philosophy of Science Part B 29 (1):61-80.
    Complementarity is not only a feature of quantum mechanical systems but occurs also in the context of finite automata.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  19. T. Acton, S. Caffrey, S. Dunn, P. Vinson & K. Svozil (1998). Analogues of Quantum Complementarity in the Theory of Automata - a Prolegomenon to the Philosophy of Quantum Mechanics. Studies in History and Philosophy of Science Part B 29 (1):61-80.
    Complementarity is not only a feature of quantum mechanical systems but occurs also in the context of finite automata.
     
    Export citation  
     
    My bibliography  
  20.  9
    P. J. M. (1966). Introduction to the Theory of Finite Automata. Review of Metaphysics 19 (4):814-814.
  21.  6
    Howard Gutowitz (1996). Cellular Automata and the Sciences of Complexity (Part I): A Review of Some Outstanding Problems in the Theory of Cellular Automata. [REVIEW] Complexity 1 (5):16-22.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  22.  6
    J. Richard Büchi & Charles Zaiontz (1983). Deterministic Automata and the Monadic Theory of Ordinals < Ω2. Mathematical Logic Quarterly 29 (5):313-336.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  23. Jiri Becvar (1964). Review: N. E. Kobrinskij, B. A. Trahtenbrot, Introduction to the Theory of Finite Automata. [REVIEW] Journal of Symbolic Logic 29 (2):97-98.
     
    Export citation  
     
    My bibliography  
  24.  13
    R. Nowakowski (1965). A Structural Theory of Matrix-Defined Finite Automata. Studia Logica 16 (1):115-116.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  25.  2
    J. M. P. (1966). Introduction to the Theory of Finite Automata. [REVIEW] Review of Metaphysics 19 (4):814-814.
  26.  11
    Jerzy Nowak (1969). A Theory of Finite Many-Output Automata Defined by Matrices. Studia Logica 24 (1):55 - 81.
  27.  3
    S. Huzino (1972). Review: Robert McNaughton, The Theory of Automata, a Survey. [REVIEW] Journal of Symbolic Logic 37 (4):760-760.
    Direct download  
     
    Export citation  
     
    My bibliography  
  28.  2
    Stephen L. Bloom (1991). Büchi J. Richard. Finite Automata, Their Algebras and Grammars. Towards a Theory of Formal Expressions. Edited by Siefkes Dirk. Springer-Verlag, New York, Berlin, Heidelberg, Etc., 1989, Xii+ 316 Pp. [REVIEW] Journal of Symbolic Logic 56 (2):762-763.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  29.  2
    Robert McNaughton (1968). Review: N. E. Kobrinskii, B. A. Trakhtenbrot, Introduction to the Theory of Finite Automata. [REVIEW] Journal of Symbolic Logic 33 (3):466-466.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  30. V. Vuckovic (1967). Review: Ryszard Nowakowski, A Structural Theory of Matrix-Defined Finite Automata. [REVIEW] Journal of Symbolic Logic 32 (3):391-391.
     
    Export citation  
     
    My bibliography  
  31.  1
    Stephen L. Bloom (1991). Review: J. Richard Buchi, Dirk Siefkes, Finite Automata, Their Algebras and Grammars. Towards a Theory of Formal Expressions. [REVIEW] Journal of Symbolic Logic 56 (2):762-763.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  32.  1
    James Worthington (2012). A Bialgebraic Approach to Automata and Formal Language Theory. Annals of Pure and Applied Logic 163 (7):745-762.
  33. F. B. Cannonito (1968). Rado Tibor. On a Simple Source for Non-Computable Functions. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute Symposia Series Vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, Pp. 75–81. [REVIEW] Journal of Symbolic Logic 32 (4):524.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  34. F. B. Cannonito (1968). Tennenbaum S.. Degree of Unsolvability and the Rate of Growth of Functions. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute Symposia Series Vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, Pp. 71–73. [REVIEW] Journal of Symbolic Logic 32 (4):524.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  35.  10
    J. Carroll & Darrell Long (1989). Theory of Finite Automata with an Introduction to Formal Languages.
  36. Robert L. Constable (1980). The Role of Finite Automata in the Development of Modern Computing Theory. In J. Barwise, H. J. Keisler & K. Kunen (eds.), The Kleene Symposium. North-Holland 61--83.
     
    Export citation  
     
    My bibliography  
  37. Joyce Friedman (1967). Dunham B., Fridshal R., and Sward G. L.. A Non-Heuristic Program for Proving Elementary Logical Theorems. English, with French, German, Russian, and Spanish Summaries. Information Processing, Proceedings of the International Conference on Information Processing, Unesco, Paris 15–20 June 1959, Unesco, Paris, R. Oldenbourg, Munich, and Butterworths, London, 1960, Pp. 282–285.Dunham B., Fridshal R., and North J. H.. Exploratory Mathematics by Machine. Recent Developments in Information and Decision Processes, Edited by Machol Robert E. And Gray Paul, The Macmillan Company, New York 1962, Pp. 149–160.Dunham B. And North J. H.. Theorem Testing by Computer. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N. Y., April 24, 25, 26, 1962, Microwave Research Symposia Series Vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, Pp. 173–177. [REVIEW] Journal of Symbolic Logic 32 (2):266.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  38. S. Huzino (1972). McNaughton Robert. The Theory of Automata, a Survey. Advances in Computers, Volume 2, Edited by Alt Franz L., Academic Press, New York and London 1961, Pp. 379–421. [REVIEW] Journal of Symbolic Logic 37 (4):760.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  39. Robert McNaughton (1968). Kobrinskii N. E. And Trakhtenbrot B. A.. Introduction to the Theory of Finite Automata. English Translation of XXIX 97, Edited by Shepherdson J. C.. Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, Amsterdam 1965, X + 337 Pp. [REVIEW] Journal of Symbolic Logic 33 (3):466.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  40. Robert Mcnaughton (1972). The Theory of Automata, a Survey. Journal of Symbolic Logic 37 (4):760-760.
    Direct download  
     
    Export citation  
     
    My bibliography  
  41. Steven S. Muchnick (1977). Bertoni A.. Mathematical Methods of the Theory of Stochastic Automata. Mathematical Foundations of Computer Science, 3rd Symposium at Jadwisin Near Warsaw, June 17–22, 1974, Edited by Blikle A., Lecture Notes in Computer Science, Vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, Pp. 9–22.Freivald R. V.. Functions Computable in the Limit by Probabilistic Machines. Mathematical Foundations of Computer Science, 3rd Symposium at Jadwisin Near Warsaw, June 17–22, 1974, Edited by Blikle A., Lecture Notes in Computer Science, Vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, Pp. 77–87.Goetze B. And Klette R.. Some Properties of Limit Recursive Functions. Mathematical Foundations of Computer Science, 3rd Symposium at Jadwisin Near Warsaw, June 17–22, 1974, Edited by Blikle A., Lecture Notes in Computer Science, Vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, Pp. 88–90.Dahl Ole-Johan. An Approach to Correctness Proofs of Semicoroutines. Mathemat. [REVIEW] Journal of Symbolic Logic 42 (3):422-423.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  42. Zdzislaw Pawlak (1956). Review: Gr. C. Moisil, Application of Galois Fields in the Theory of Automata. I. On Circuits with Rectifiers. [REVIEW] Journal of Symbolic Logic 21 (4):398-398.
    Direct download  
     
    Export citation  
     
    My bibliography  
  43. Zdzislaw Pawlak (1956). Review: Gr. C. Moisil, Application of Galois Fields in the Theory of Automata. II. Circuits with Two Intermediate Elements. [REVIEW] Journal of Symbolic Logic 21 (4):398-399.
    Direct download  
     
    Export citation  
     
    My bibliography  
  44. Michael O. Rabin (1969). Schützenberger M. P.. On the Definition of a Family of Automata. Information and Control, Vol. 4 , Pp. 245–270.Schützenberger M. P.. Finite Counting Automata. Information and Control, Vol. 5 , Pp. 91–107.Schützenberger M. P.. 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 York 1963, Pp. 139–153. [REVIEW] Journal of Symbolic Logic 34 (2):296-297.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45. S. Rudeanu (1970). McCluskey E. J. Jr., and Schorr H.. Essential Multiple-Output Prime Implicants. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute Symposia Series Vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, Pp. 437–457. [REVIEW] Journal of Symbolic Logic 35 (3):483.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  46. Dirk Siefkes (1975). Rabin Michael O.. Weakly Definable Relations and Special Automata. Mathematical Logic and Foundations of Set Theory, Proceedings of an International Colloquium Held Under the Auspices of the Israel Academy of Sciences and Humanities, Jerusalem, 11-14 November 1968, Edited by Bar-Hillel Yehoshua, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, Amsterdam and London 1970, Pp. 1–23. [REVIEW] Journal of Symbolic Logic 40 (4):622-623.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  47. Patrick Suppes (1969). Stimulus-Response Theory of Automata and TOTE Hierarchies: A Reply to Arbib. Psychological Review 76 (5):511-514.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  48. K. Svozil (1998). Analogues of Quantum Complementarity in the Theory of Automata. Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 29 (1):61-80.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  49. Mary Katherine Yntema (1968). Davis Martin. Unsolvable Problems: A Review. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute Symposia Series Vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, Pp. 15–22. [REVIEW] Journal of Symbolic Logic 33 (2):297-298.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  50. Mary Katherine Yntema (1968). Watanabe Shigeru. Periodicity of Post's Normal Process of Tag. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute Symposia Series Vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, Pp. 83–99. [REVIEW] Journal of Symbolic Logic 33 (2):298.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 1000