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

1000+ found
Order:
  1.  5
    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.  9
    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. Mark H. Bickhard (1982). Automata Theory, Artificial Intelligence and Genetic Epistemology. Revue Internationale de Philosophie 36 (4):549.
     
    Export citation  
     
    My bibliography   1 citation  
  4. 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  
  5.  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  
  6. 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  
  7. 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  
  8. Jill Humphries (1973). Automata Theory as a Model of Biological Replication, Adaptation and Evolution. Dissertation, University of Waterloo (Canada)
     
    Export citation  
     
    My bibliography  
  9. Jean-Éric Pin (2011). J. Sakarovitch, Elements of Automata Theory. Bulletin of Symbolic Logic 17 (1):122.
  10. R. Ramanujam (2012). Memory and Logic: A Tale From Automata Theory. Journal of the Indian Council of Philosophical Research 1.
     
    Export citation  
     
    My bibliography  
  11. 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.
  12.  19
    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  
  13.  37
    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  
  14.  23
    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.
    Direct download  
     
    Export citation  
     
    My bibliography  
  15.  3
    P. J. M. (1966). Introduction to the Theory of Finite Automata. Review of Metaphysics 19 (4):814-814.
  16.  1
    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  
  17. 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  
  18.  4
    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  
  19.  8
    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  
  20.  2
    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  
  21.  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  
     
    Export citation  
     
    My bibliography  
  22.  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  
  23.  7
    Jerzy Nowak (1969). A Theory of Finite Many-Output Automata Defined by Matrices. Studia Logica 24 (1):55 - 81.
  24. 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  
  25.  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  
  26.  1
    James Worthington (2012). A Bialgebraic Approach to Automata and Formal Language Theory. Annals of Pure and Applied Logic 163 (7):745-762.
  27. J. Carroll & Darrell Long (1989). Theory of Finite Automata with an Introduction to Formal Languages.
  28. 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  
  29. Robert Mcnaughton (1972). The Theory of Automata, a Survey. Journal of Symbolic Logic 37 (4):760-760.
    Direct download  
     
    Export citation  
     
    My bibliography  
  30. 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  
  31. 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  
  32. J. M. P. (1966). Introduction to the Theory of Finite Automata. [REVIEW] Review of Metaphysics 19 (4):814-814.
  33. 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  
  34.  27
    Swarup Mohalik & R. Ramanujam (2010). Automata for Epistemic Temporal Logic with Synchronous Communication. Journal of Logic, Language and Information 19 (4):451-484.
    We suggest that developing automata theoretic foundations is relevant for knowledge theory, so that we study not only what is known by agents, but also the mechanisms by which such knowledge is arrived at. We define a class of epistemic automata, in which agents’ local states are annotated with abstract knowledge assertions about others. These are finite state agents who communicate synchronously with each other and information exchange is ‘perfect’. We show that the class of recognizable languages (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  35.  3
    Alessandro Bisio, Giacomo Mauro D’Ariano, Paolo Perinotti & Alessandro Tosini (2015). Weyl, Dirac and Maxwell Quantum Cellular Automata. Foundations of Physics 45 (10):1203-1221.
    Recent advances on quantum foundations achieved the derivation of free quantum field theory from general principles, without referring to mechanical notions and relativistic invariance. From the aforementioned principles a quantum cellular automata theory follows, whose relativistic limit of small wave-vector provides the free dynamics of quantum field theory. The QCA theory can be regarded as an extended quantum field theory that describes in a unified way all scales ranging from an hypothetical discrete Planck scale (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  36.  17
    Milic Capek (1954). James's Early Criticism of the Automaton Theory. Journal of the History of Ideas 15 (April):260-279.
  37.  21
    Patrick Grim (1997). The Undecidability of the Spatialized Prisoner's Dilemma. Theory and Decision 42 (1):53-80.
    In the spatialized Prisoner's Dilemma, players compete against their immediate neighbors and adopt a neighbor's strategy should it prove locally superior. Fields of strategies evolve in the manner of cellular automata (Nowak and May, 1993; Mar and St. Denis, 1993a,b; Grim 1995, 1996). Often a question arises as to what the eventual outcome of an initial spatial configuration of strategies will be: Will a single strategy prove triumphant in the sense of progressively conquering more and more territory without opposition, (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  38.  13
    Shane Steinert-Threlkeld & Thomas F. Icard Iii (2013). Iterating Semantic Automata. Linguistics and Philosophy 36 (2):151-173.
    The semantic automata framework, developed originally in the 1980s, provides computational interpretations of generalized quantifiers. While recent experimental results have associated structural features of these automata with neuroanatomical demands in processing sentences with quantifiers, the theoretical framework has remained largely unexplored. In this paper, after presenting some classic results on semantic automata in a modern style, we present the first application of semantic automata to polyadic quantification, exhibiting automata for iterated quantifiers. We also discuss the (...)
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  39.  24
    Gerard ’T. Hooft (2013). Duality Between a Deterministic Cellular Automaton and a Bosonic Quantum Field Theory in 1+1 Dimensions. Foundations of Physics 43 (5):597-614.
    Methods developed in a previous paper are employed to define an exact correspondence between the states of a deterministic cellular automaton in 1+1 dimensions and those of a bosonic quantum field theory. The result may be used to argue that quantum field theories may be much closer related to deterministic automata than what is usually thought possible.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  40.  9
    Joseph Y. Halpern, Rafael Pass & Lior Seeman (2014). Decision Theory with Resource‐Bounded Agents. Topics in Cognitive Science 6 (2):245-257.
    There have been two major lines of research aimed at capturing resource-bounded players in game theory. The first, initiated by Rubinstein (), charges an agent for doing costly computation; the second, initiated by Neyman (), does not charge for computation, but limits the computation that agents can do, typically by modeling agents as finite automata. We review recent work on applying both approaches in the context of decision theory. For the first approach, we take the objects of (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  41.  11
    Shane Steinert-Threlkeld & I. I. I. Thomas F. Icard (2013). Iterating Semantic Automata. Linguistics and Philosophy 36 (2):151-173.
    The semantic automata framework, developed originally in the 1980s, provides computational interpretations of generalized quantifiers. While recent experimental results have associated structural features of these automata with neuroanatomical demands in processing sentences with quantifiers, the theoretical framework has remained largely unexplored. In this paper, after presenting some classic results on semantic automata in a modern style, we present the first application of semantic automata to polyadic quantification, exhibiting automata for iterated quantifiers. We also discuss the (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  42.  2
    Zeno Vendler (1984). The Matter of Minds. Clarendon Press.
  43.  50
    Philippe Gagnon (2013). "Que reste-t-il de la théologie à l'âge électronique ? Valeur et cybernétique axiologique chez Raymond Ruyer" [What is left of Theology in the Electronic Age? Value and Axiological Cybernetics in Raymond Ruyer]. In Chromatikon Ix: Annales de la Philosophie En Procès — Yearbook of Philosophy in Process, M. Weber & V. Berne. 93-120.
    This is the outline: Introduction — La question de la cybernétique et de l'information — Une « pensée du milieu » — Cybernétique et homologie — Une théorie de l'apprentissage — L'information vue de l'autre côté — Champ et domaine unitaire — La thèse des « autres-je » — Le passage par l'axiologie — La rétroaction vraie — L'ontologie de Ruyer — Le bruissement de l'être même.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  44.  16
    Raymond J. Nelson (1978). Objects of Occasion Beliefs. Synthese 39 (September):105-139.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  45.  31
    Luca Alberucci & Vincenzo Salipante (2004). On Modal Μ-Calculus and Non-Well-Founded Set Theory. Journal of Philosophical Logic 33 (4):343-360.
    A finitary characterization for non-well-founded sets with finite transitive closure is established in terms of a greatest fixpoint formula of the modal μ-calculus. This generalizes the standard result in the literature where a finitary modal characterization is provided only for wellfounded sets with finite transitive closure. The proof relies on the concept of automaton, leading then to new interlinks between automata theory and non-well-founded sets.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography  
  46.  87
    Gualtiero Piccinini (2004). The First Computational Theory of Mind and Brain: A Close Look at McCulloch and Pitts' Logical Calculus of Ideas Immanent in Nervous Activity. Synthese 141 (2):175-215.
    Despite its significance in neuroscience and computation, McCulloch and Pitts's celebrated 1943 paper has received little historical and philosophical attention. In 1943 there already existed a lively community of biophysicists doing mathematical work on neural networks. What was novel in McCulloch and Pitts's paper was their use of logic and computation to understand neural, and thus mental, activity. McCulloch and Pitts's contributions included (i) a formalism whose refinement and generalization led to the notion of finite automata (an important formalism (...)
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   16 citations  
  47.  8
    Sasha Rubin (2008). Automata Presenting Structures: A Survey of the Finite String Case. Bulletin of Symbolic Logic 14 (2):169-209.
    A structure has a (finite-string) automatic presentation if the elements of its domain can be named by finite strings in such a way that the coded domain and the coded atomic operations are recognised by synchronous multitape automata. Consequently, every structure with an automatic presentation has a decidable first-order theory. The problems surveyed here include the classification of classes of structures with automatic presentations, the complexity of the isomorphism problem, and the relationship between definability and recognisability.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  48.  15
    Andrew Schumann (2011). Qal Wa- Omer and Theory of Massive-Parallel Proofs. History and Philosophy of Logic 32 (1):71-83.
    In this article, the author attempts to explicate the notion of the best known Talmudic inference rule called qal wa- omer. He claims that this rule assumes a massive-parallel deduction, and for formalizing it, he builds up a case of massive-parallel proof theory, the proof-theoretic cellular automata, where he draws conclusions without using axioms.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  49.  22
    Stanley Gudder (2000). Basic Properties of Quantum Automata. Foundations of Physics 30 (2):301-319.
    This paper develops a theory of quantum automata and their slightly more general versions, q-automata. Quantum languages and η-quantum languages, 0≤η<1, are studied. Functions that can be realized as probability maps for q-automata are characterized. Quantum grammars are discussed and it is shown that quantum languages are precisely those languages that are induced by a quantum grammar. A quantum pumping lemma is employed to show that there are regular languages that are not η-quantum, 0≤η<1.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  50.  3
    Vyacheslav Kalmykov & Lev Kalmykov (2015). A Solution to the Biodiversity Paradox by Logical Deterministic Cellular Automata. Acta Biotheoretica 63 (2):203-221.
    The paradox of biological diversity is the key problem of theoretical ecology. The paradox consists in the contradiction between the competitive exclusion principle and the observed biodiversity. The principle is important as the basis for ecological theory. On a relatively simple model we show a mechanism of indefinite coexistence of complete competitors which violates the known formulations of the competitive exclusion principle. This mechanism is based on timely recovery of limiting resources and their spatio-temporal allocation between competitors. Because of (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
1 — 50 / 1000