Showing papers on "Formal language published in 1970"
TL;DR: Goodman as mentioned in this paper presented a study on languages of art and their relationship to a theory of symbols. But the focus of the study was not on the language arts, but on the theory of art itself.
Abstract: the language of art inquiry based studio practices in. integrating the language arts eric digest. language teaching methods. impressionism definition history art amp facts britannica. nelson goodman s languages of art notation and artistic. languages of art an approach to a theory of symbols. unsupervised mt fast and accurate for more languages. languages of art. language arts ideas in the classroom education world. everything about reggio emilia approach you can t skip. languages of art an approach to a theory of symbols. monoskop. the six language arts definitions amp skills video. languages of art an approach to a theory of symbols. languages of art an approach to a theory of symbols. languages of art an approach to a theory of symbols by. the language of art reggio emilia art activities for the. rpns the 100 languages of children. languages of art ??. languages of art 9780915144341 goodman. the reggio emilia approach scholastic. pdf summary of the thesis a study on languages of art. the language of art inquiry based studio practices in. what is the definition of art thoughtco. the natural approach vobs. language through art beginning level education at the. languages of art an approach to a theory of symbols. learning the language of art. languages of art an approach to a theory of symbols. philosophy and principles the reggio emilia approach an. the languages of art an approach to a theory of symbols. goodman s aesthetics stanford encyclopedia of philosophy. languages of art open library. why integrate the language arts. nelson goodman languages of art
478 citations
TL;DR: It is concluded that at least minimally effective techniques have been devised for answering questions from natural language subsets in small scale experimental systems and that a useful paradigm has evolved to guide research efforts in the field.
Abstract: Recent experiments in programming natural language question-answering systems are reviewed to summarize the methods that have been developed for syntactic, semantic, and logical analysis of English strings. It is concluded that at least minimally effective techniques have been devised for answering questions from natural language subsets in small scale experimental systems and that a useful paradigm has evolved to guide research efforts in the field. Current approaches to semantic analysis and logical inference are seen to be effective beginnings but of questionable generality with respect either to subtle aspects of meaning or to applications over large subsets of English. Generalizing from current small-scale experiments to language-processing systems based on dictionaries with thousands of entries—with correspondingly large grammars and semantic systems—may entail a new order of complexity and require the invention and development of entirely different approaches to semantic analysis and question answering.
164 citations
84 citations
28 Oct 1970
TL;DR: Many positive results are presented to indicate that the context-free languages can, perhaps, be accepted in time n and space n by cellular automata.
Abstract: A set of equivalences is established among cellular automata, iterative acceptors, and linear-bounded automata However, cellular automata are shown to be inherently faster than iterative acceptors Many positive results are presented to indicate that the context-free languages can, perhaps, be accepted in time n and space n by cellular automata
56 citations
TL;DR: The essence of various proofs of undecidability are abstracted and wide classes of properties and general conditions on families of languages such that these proofs of Undecidable hold are found.
48 citations
44 citations
TL;DR: Conditions are given under which the classes of formal languages defined by non-deterministic ( deterministic) tape-bounded Turing acceptors will be principal AFLs.
17 citations
01 Jan 1970
TL;DR: Hllbert's programme concerned the formalization, that Is mechanization of mathematical reasoning, of formal languages to represent mathematical assertions and for formal rules of inference to generate mathematical proofs.
Abstract: Hllbert's programme concerned the formalization, that Is mechanization of mathematical reasoning It looked for formal languages (given by 'mechanical' rules as analysed by Turing) to represent mathematical assertions and for formal rules of inference to generate (representations of) mathematical proofs As understood naively the search for automatic proof procedures, or more precisely, mechanical ones is the following 'practical' variant of Hilbert's programme
14 citations
TL;DR: It is found that the first two classes of errors yield essentially equivalent effects on properties of the automata considered, and that the same is true for the latter two classes (called ''expanding'' errors).
14 citations
TL;DR: An algorithm is described which accepts an arbitrary context-free grammar and constructs a bounded-context parser for it whenever such a parser exists and is claimed to be particularly useful in the simultaneous design of a language and a compiler for it.
Abstract: An algorithm is described which accepts an arbitrary context-free grammar and constructs a bounded-context parser for it whenever such a parser exists. In the first part of the paper the definition of a context-free grammar and the working of a bounded-context parser are recalled. The notion of reduction class for a context-free grammar is then introduced and its connection with the structure of a bounded-context parser is indicated. Next, pushdown automata which generate the different reduction classes of a context-free grammar are defined. Finally, the algorithm is described; it essentially carries out an exhaustive study of all possible runs of the pushdown automata generating the reduction classes. In the second part, the utility of the algorithm is discussed in the light of the experience gained from its use in compiler design. The algorithm is claimed to be particularly useful in the simultaneous design of a language and a compiler for it.
13 citations
04 May 1970
TL;DR: Complexity classes of formal languages defined by time- and tape-bounded Turing acceptors are studied with the aim of showing sufficient conditions for these classes to be AFLs and to be principal AFLs.
Abstract: Complexity classes of formal languages defined by time- and tape-bounded Turing acceptors are studied with the aim of showing sufficient conditions for these classes to be AFLs and to be principal AFLs.
Dissertation•
01 Jan 1970
01 Jan 1970
TL;DR: In this article, a Gold-style learning algorithm called KRPNI was proposed, which applied the grammatical inference technique to identify a language and expressed it by a k-DFA.
Abstract: Learnability of languages is a challenging problem in the domain of formal language identification. It is known that the efficiency of a learning technique can be measured by the size of some good samples (representative or distinctive samples) formally called a characteristic set. Our research focuses on the characteristic set of k-acceptable languages. We proposed a Gold-style learning algorithm called KRPNI which applied the grammatical inference technique to identify a language and expressed it by a k-DFA. In this paper, we study the existence of such characteristic sets. Our theoretical results show that there exists a polynomial characteristic set for a k-acceptable language. It is found that the size of the characteristic set depends on the value of k, instead of the size of an alphabet.
01 Jan 1970
TL;DR: This paper describes the second course in a graduate sequence in Computer Science given at the University of Tennessee, Knoxville, which employs formal language theory as the vehicle for presenting concepts related to the theory of programming languages and the structure of grammars to examine various aspects of automata theory.
Abstract: This paper describes the second course in a graduate sequence in Computer Science given at the University of Tennessee, Knoxville. The purpose of this sequence is to provide students with a theoretical base in formal language theory for understanding and interpretation of concepts and relationships in programming and automata theory. The explicit purpose of the second course, “The Relationship of Formal Language Theory to Automata”, is to use the structure of grammars, primarily context-free grammars, to examine various aspects of automata theory. These aspects include deterministic and non-deterministic acceptors, processors with pushdown stores, and finite state machines. The first course in the series employs formal language theory as the vehicle for presenting concepts related to the theory of programming languages; this second course employs the same vehicle for presenting aspects of automata theory. The two courses combined achieve a unity whereby important relationships between programming and automata theory as well as applications stemming from these theories can be derived.This course meets for one and a half hours twice a week for ten weeks. Prerequisites for this course include the first course in this sequence, as well as, an intermediate sequence of courses in machine organization and programming languages plus basic courses in numerical analysis, probability and statistics, and at least two years of calculus.