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

1000+ found
Sort by:
  1. Dennis P. Waters (2012). Von Neumann's Theory of Self-Reproducing Automata: A Useful Framework for Biosemiotics? Biosemiotics 5 (1):5-15.score: 156.0
    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 (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  2. Robert F. Barnes (1975). Review: Dana Scott, Some Definitional Suggestions for Automata Theory. [REVIEW] Journal of Symbolic Logic 40 (4):615-616.score: 150.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. Stephen A. Cook (1971). Review: Jiri Becvar, Real-Time and Complexity Problems in Automata Theory. [REVIEW] Journal of Symbolic Logic 36 (2):346-346.score: 150.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. 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.score: 150.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Jean-Éric Pin (2011). J. Sakarovitch, Elements of Automata Theory. Bulletin of Symbolic Logic 17 (1):122.score: 150.0
     
    My bibliography  
     
    Export citation  
  6. 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.score: 150.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Raymond J. Nelson (1975). Behaviorism, Finite Automata, and Stimulus-Response Theory. Theory and Decision 6 (August):249-67.score: 144.0
    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)  
     
    My bibliography  
     
    Export citation  
  8. 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.score: 126.0
    Complementarity is not only a feature of quantum mechanical systems but occurs also in the context of finite automata.
    Direct download  
     
    My bibliography  
     
    Export citation  
  9. 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.score: 120.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  10. S. Huzino (1972). Review: Robert McNaughton, The Theory of Automata, a Survey. [REVIEW] Journal of Symbolic Logic 37 (4):760-760.score: 120.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  11. 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.score: 120.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  12. Jerzy Nowak (1969). A Theory of Finite Many-Output Automata Defined by Matrices. Studia Logica 24 (1):55 - 81.score: 120.0
  13. J. Richard Büchi & Charles Zaiontz (1983). Deterministic Automata and the Monadic Theory of Ordinals < Ω2. Mathematical Logic Quarterly 29 (5):313-336.score: 120.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  14. 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.score: 120.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  15. 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.score: 120.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  16. R. Nowakowski (1965). A Structural Theory of Matrix-Defined Finite Automata. Studia Logica 16 (1):115-116.score: 120.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  17. V. Vuckovic (1967). Review: Ryszard Nowakowski, A Structural Theory of Matrix-Defined Finite Automata. [REVIEW] Journal of Symbolic Logic 32 (3):391-391.score: 120.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  18. James Worthington (2012). A Bialgebraic Approach to Automata and Formal Language Theory. Annals of Pure and Applied Logic 163 (7):745-762.score: 120.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  19. 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.score: 120.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  20. Robert L. Constable (1980). The Role of Finite Automata in the Development of Modern Computing Theory. In. In J. Barwise, H. J. Keisler & K. Kunen (eds.), The Kleene Symposium. North-Holland. 61--83.score: 120.0
    No categories
     
    My bibliography  
     
    Export citation  
  21. 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.score: 120.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  22. P. J. M. (1966). Introduction to the Theory of Finite Automata. Review of Metaphysics 19 (4):814-814.score: 120.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  23. 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.score: 120.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  24. 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.score: 120.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  25. Anatol Rapoport (1967). The Vitalist: Mentalist Controversy Theory of Self-Reproducing Automata John von Neumann Arthur W. Burks. Bioscience 17 (9):659-660.score: 120.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. Swarup Mohalik & R. Ramanujam (2010). Automata for Epistemic Temporal Logic with Synchronous Communication. Journal of Logic, Language and Information 19 (4):451-484.score: 114.0
    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)  
     
    My bibliography  
     
    Export citation  
  27. Milic Capek (1954). James's Early Criticism of the Automaton Theory. Journal of the History of Ideas 15 (April):260-279.score: 90.0
  28. Patrick Grim (1997). The Undecidability of the Spatialized Prisoner's Dilemma. Theory and Decision 42 (1):53-80.score: 78.0
    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)  
     
    My bibliography  
     
    Export citation  
  29. 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.score: 66.0
    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)  
     
    My bibliography  
     
    Export citation  
  30. Shane Steinert-Threlkeld & I. I. I. Thomas F. Icard (2013). Iterating Semantic Automata. Linguistics and Philosophy 36 (2):151-173.score: 66.0
    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)  
     
    My bibliography  
     
    Export citation  
  31. Joseph Y. Halpern, Rafael Pass & Lior Seeman (2014). Decision Theory with Resource‐Bounded Agents. Topics in Cognitive Science 6 (2):245-257.score: 66.0
    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 (3 more)  
     
    My bibliography  
     
    Export citation  
  32. 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 (Eds.). 93-120.score: 62.0
    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 to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  33. Raymond J. Nelson (1978). Objects of Occasion Beliefs. Synthese 39 (September):105-139.score: 60.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  34. Luca Alberucci & Vincenzo Salipante (2004). On Modal Μ-Calculus and Non-Well-Founded Set Theory. Journal of Philosophical Logic 33 (4):343-360.score: 60.0
    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)  
     
    My bibliography  
     
    Export citation  
  35. Zeno Vendler (1984). The Matter of Minds. Clarendon Press.score: 60.0
  36. 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.score: 54.0
    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)  
     
    My bibliography  
     
    Export citation  
  37. Stanley Gudder (2000). Basic Properties of Quantum Automata. Foundations of Physics 30 (2):301-319.score: 54.0
    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)  
     
    My bibliography  
     
    Export citation  
  38. Andrew Schumann (2011). Qal Wa- Omer and Theory of Massive-Parallel Proofs. History and Philosophy of Logic 32 (1):71-83.score: 54.0
    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)  
     
    My bibliography  
     
    Export citation  
  39. Olivier Finkel & Stevo Todorčević (2012). A Hierarchy of Tree-Automatic Structures. Journal of Symbolic Logic 77 (1):350-368.score: 54.0
    We consider ω n -automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length ω n for some integer n ≥ 1. We show that all these structures are ω-tree-automatic structures presentable by Muller or Rabin tree automata. We prove that the isomorphism relation for ω 2 -automatic (resp. ω n -automatic for n > 2) boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups) (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  40. Sasha Rubin (2008). Automata Presenting Structures: A Survey of the Finite String Case. Bulletin of Symbolic Logic 14 (2):169-209.score: 54.0
    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)  
     
    My bibliography  
     
    Export citation  
  41. Claude Lobry & Hervé Elmoznino (2000). Combinatorial Properties of Some Cellular Automata Related to the Mosaic Cycle Concept. Acta Biotheoretica 48 (3-4).score: 54.0
    A cellular automaton that is related to the "mosaic cycle concept" is considered. We explain why such automata sustain very often, but not always, n-periodic trajectories (n being the number of states of the automaton). Our work is a first step in the direction of a theory of these type of automata which might be useful in modeling mosaic successions.
    Direct download  
     
    My bibliography  
     
    Export citation  
  42. Francesco Berto & Jacopo Tagliabue (2012). Cellular Automata. Stanford Encyclopedia of Philosophy.score: 48.0
    Cellular automata (henceforth: CA) are discrete, abstract computational systems that have proved useful both as general models of complexity and as more specific representations of non-linear dynamics in a variety of scientific fields. Firstly, CA are (typically) spatially and temporally discrete: they are composed of a finite or denumerable set of homogeneous, simple units, the atoms or cells. At each time unit, the cells instantiate one of a finite set of states. They evolve in parallel at discrete time steps, (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  43. Arto Salomaa (1985). Computation and Automata. Cambridge University Press.score: 48.0
    This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.
    Direct download  
     
    My bibliography  
     
    Export citation  
  44. Simon D. Angus & Andrew Newnham (2013). The Bit‐Economy: An Artificial Model of Open‐Ended Technology Discovery. Complexity 18 (5):57-67.score: 48.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  45. Vadim Batitsky (1998). A Formal Rebuttal of the Central Argument for Functionalism. Erkenntnis 49 (2):201-20.score: 42.0
    The central argument for functionalism is the so-called argument from multiple realizations. According to this argument, because a functionally characterized system admits a potential infinity of structurally diverse physical realizations, the functional organization of such systems cannot be captured in a law-like manner at the level of physical description (and, thus, must be treated as a principally autonomous domain of inquiry). I offer a rebuttal of this argument based on formal modeling of its premises in the framework of automata (...)
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  46. Robert Van Gulick (1982). Functionalism as a Theory of Mind. Philosophy Research Archives 8:185-204.score: 42.0
    A general characterization of functionalist theories of mind is offered and a number of issues are discussed which allow for alternative versions of functionalism. Some issues, such as the distinction between the implicit definition and partial specification views are of a general nature, while others raise questions more specific to functionalism, such as whether the relation between psychological and physiological properties is one of identity or instantiation. Section II attempts to undermine several arguments which have been offered to support the (...)
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  47. Arto Salomaa (1972). Review: Michael A. Arbib, Theories of Abstract Automata. [REVIEW] Journal of Symbolic Logic 37 (2):412-413.score: 40.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  48. Dirk Siefkes (1972). Review: Michael O. Rabin, Decidability of Second-Order Theories and Automata on Infinite Trees. [REVIEW] Journal of Symbolic Logic 37 (3):618-619.score: 40.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  49. David J. Chalmers (1996). Does a Rock Implement Every Finite-State Automaton? Synthese 108 (3):309-33.score: 36.0
    Hilary Putnam has argued that computational functionalism cannot serve as a foundation for the study of the mind, as every ordinary open physical system implements every finite-state automaton. I argue that Putnam's argument fails, but that it points out the need for a better understanding of the bridge between the theory of computation and the theory of physical systems: the relation of implementation. It also raises questions about the class of automata that can serve as a basis (...)
    Direct download (14 more)  
     
    My bibliography  
     
    Export citation  
  50. Jakub Szymanik (2009). Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language. Dissertation, University of Amsterdamscore: 36.0
    In the dissertation we study the complexity of generalized quantifiers in natural language. Our perspective is interdisciplinary: we combine philosophical insights with theoretical computer science, experimental cognitive science and linguistic theories. -/- In Chapter 1 we argue for identifying a part of meaning, the so-called referential meaning (model-checking), with algorithms. Moreover, we discuss the influence of computational complexity theory on cognitive tasks. We give some arguments to treat as cognitively tractable only those problems which can be computed in polynomial (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000