Robert W. Floyd and Richard Beigel. The language of machines. An introduction to computability and formal languages. Computer Science Press, New York1994, xvii + 706 pp.

1996 ◽  
Vol 61 (2) ◽  
pp. 701-703
Author(s):  
Raymond D. Gumb
Keyword(s):  
Computer Science ◽  
Formal Languages

scholarly journals Computational Intention

2020 ◽  
Vol 63 (1) ◽  
pp. 19-30
Author(s):  
Raymond Turner
Keyword(s):  
Computer Science ◽  
Formal Languages ◽  
Type Inference ◽  
Philosophy Of Computer Science ◽  
The Core ◽  
Inference Systems

Abstract The core entities of computer science include formal languages, spec-ifications, models, programs, implementations, semantic theories, type inference systems, abstract and physical machines. While there are conceptual questions concerning their nature, and in particular ontological ones (Turner 2018), our main focus here will be on the relationships between them. These relationships have an extensional aspect that articulates the propositional connection between the two entities, and an intentional one that fixes the direction of governance. An analysis of these two aspects will drive our investigation; an investigation that will touch upon some of the central concerns of the philosophy of computer science (Turner 2017).

scholarly journals An Introduction to Grammatical Inference for Linguists

Triangle ◽  
2018 ◽  
pp. 1
Author(s):  
Leonor Becerra-Bonache
Keyword(s):  
Machine Learning ◽  
Language Acquisition ◽  
Natural Language ◽  
Language Learning ◽  
Computer Science ◽  
Special Interest ◽  
Formal Languages ◽  
Grammatical Inference ◽  
Basic Concepts

This paper is meant to be an introductory guide to Grammatical Inference (GI), i.e., the study of machine learning of formal languages. It is designed for non-specialists in Computer Science, but with a special interest in language learning. It covers basic concepts and models developed in the framework of GI, and tries to point out the relevance of these studies for natural language acquisition.

scholarly journals Hypercompositional Algebra, Computer Science and Geometry

Mathematics ◽  
2020 ◽  
Vol 8 (8) ◽  
pp. 1338 ◽  
Author(s):  
Gerasimos Massouros ◽  
Christos Massouros
Keyword(s):  
Computer Science ◽  
Formal Languages ◽  
Helly’S Theorem ◽  
Projective Geometries ◽  
Carathéodory’S Theorem ◽  
Close Relationship ◽  
Radon’S Theorem ◽  
Steinitz’S Theorem ◽  
Stone’S Theorem

The various branches of Mathematics are not separated between themselves. On the contrary, they interact and extend into each other’s sometimes seemingly different and unrelated areas and help them advance. In this sense, the Hypercompositional Algebra’s path has crossed, among others, with the paths of the theory of Formal Languages, Automata and Geometry. This paper presents the course of development from the hypergroup, as it was initially defined in 1934 by F. Marty to the hypergroups which are endowed with more axioms and allow the proof of Theorems and Propositions that generalize Kleen’s Theorem, determine the order and the grade of the states of an automaton, minimize it and describe its operation. The same hypergroups lie underneath Geometry and they produce results which give as Corollaries well known named Theorems in Geometry, like Helly’s Theorem, Kakutani’s Lemma, Stone’s Theorem, Radon’s Theorem, Caratheodory’s Theorem and Steinitz’s Theorem. This paper also highlights the close relationship between the hyperfields and the hypermodules to geometries, like projective geometries and spherical geometries.

scholarly journals Preface to the volume Languages: Bionspired Approaches

Triangle ◽  
2018 ◽  
Author(s):  
Gemma Bel Enguiz
Keyword(s):  
Computer Science ◽  
Formal Language ◽  
Mutual Influence ◽  
Formal Languages ◽  
Formal Language Theory ◽  
Language Theory ◽  
Economic Modelling ◽  
Natural Languages ◽  
Separate Branch ◽  
Wide Range

Languages, whether they be natural or artificial, are particular cases of a symbol system. And the manipulation of symbols is the stem of formal language theory. The theory of formal languages mainly originated from mathematics and generative linguistics. It was born in the middle of the 20th century as a tool for modelling and investigating the syntax of natural languages. After 1964, it developed as a separate branch with specific problems, techniques and results and since then it has had an important role in the field of computer science. Formal language theory, due to its abstract and formal properties, has been applied to a wide range of fields (besides initial linguistic motivation): economic modelling, developmental biology, cryptography, sociology... Therefore, natural languages, computer science and formal languages had a mutual influence over the years.

scholarly journals Philosophy of Computer Science

Philosophy ◽  
2019 ◽  
Author(s):  
Raymond Turner
Keyword(s):  
Computer Science ◽  
Subject Matter ◽  
Formal Languages ◽  
Semantic Interpretation ◽  
Ontological Status ◽  
Philosophy Of Computer Science ◽  
Correctness Proofs ◽  
Scientific Investigations ◽  
The Subject ◽  
Engineering Practices

The subject matter of computer science encompasses a large number of different activities that range from abstract mathematical topics through core engineering practices and scientific investigations. Subsequently, the philosophy of computer science overlaps with the philosophies of mathematics, science, and technology, and the central philosophical concerns of these disciplines all have computational analogues. The ontological status of programs, the nature of computational abstraction, and the kind of knowledge delivered by correctness proofs are central instances. In addition, because of the focus of computer science on formal languages and their semantic interpretation, the philosophy of computer science draws in topics and inspiration from the philosophies of language and mind.

Sign in / Sign up

Export Citation Format

Share Document