Introduction to Switching and Automata Theory
Author : Michael A. Harrison
Publisher :
Page : 542 pages
File Size : 48,32 MB
Release : 1965
Category : Sequential machine theory
ISBN :
Author : Michael A. Harrison
Publisher :
Page : 542 pages
File Size : 48,32 MB
Release : 1965
Category : Sequential machine theory
ISBN :
Author : Robert N. Moll
Publisher : Springer Science & Business Media
Page : 214 pages
File Size : 33,77 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 146139595X
The study of formal languages and of related families of automata has long been at the core of theoretical computer science. Until recently, the main reasons for this centrality were connected with the specification and analy sis of programming languages, which led naturally to the following ques tions. How might a grammar be written for such a language? How could we check whether a text were or were not a well-formed program generated by that grammar? How could we parse a program to provide the structural analysis needed by a compiler? How could we check for ambiguity to en sure that a program has a unique analysis to be passed to the computer? This focus on programming languages has now been broadened by the in creasing concern of computer scientists with designing interfaces which allow humans to communicate with computers in a natural language, at least concerning problems in some well-delimited domain of discourse. The necessary work in computational linguistics draws on studies both within linguistics (the analysis of human languages) and within artificial intelligence. The present volume is the first textbook to combine the topics of formal language theory traditionally taught in the context of program ming languages with an introduction to issues in computational linguistics. It is one of a series, The AKM Series in Theoretical Computer Science, designed to make key mathematical developments in computer science readily accessible to undergraduate and beginning graduate students.
Author : György E. Révész
Publisher : Courier Corporation
Page : 208 pages
File Size : 11,90 MB
Release : 2015-03-17
Category : Mathematics
ISBN : 0486169375
Covers all areas, including operations on languages, context-sensitive languages, automata, decidability, syntax analysis, derivation languages, and more. Numerous worked examples, problem exercises, and elegant mathematical proofs. 1983 edition.
Author : Peter Linz
Publisher : Jones & Bartlett Publishers
Page : 408 pages
File Size : 31,46 MB
Release : 1997
Category : Computers
ISBN :
An Introduction to Formal Languages & Automata provides an excellent presentation of the material that is essential to an introductory theory of computation course. The text was designed to familiarize students with the foundations & principles of computer science & to strengthen the students' ability to carry out formal & rigorous mathematical argument. Employing a problem-solving approach, the text provides students insight into the course material by stressing intuitive motivation & illustration of ideas through straightforward explanations & solid mathematical proofs. By emphasizing learning through problem solving, students learn the material primarily through problem-type illustrative examples that show the motivation behind the concepts, as well as their connection to the theorems & definitions.
Author : Willem J. M. Levelt
Publisher : John Benjamins Publishing
Page : 151 pages
File Size : 26,5 MB
Release : 2008
Category : Language Arts & Disciplines
ISBN : 9027232504
The present text is a re-edition of Volume I of Formal Grammars in Linguistics and Psycholinguistics, a three-volume work published in 1974. This volume is an entirely self-contained introduction to the theory of formal grammars and automata, which hasn't lost any of its relevance. Of course, major new developments have seen the light since this introduction was first published, but it still provides the indispensible basic notions from which later work proceeded. The author's reasons for writing this text are still relevant: an introduction that does not suppose an acquaintance with sophisticated mathematical theories and methods, that is intended specifically for linguists and psycholinguists (thus including such topics as learnability and probabilistic grammars), and that provides students of language with a reference text for the basic notions in the theory of formal grammars and automata, as they keep being referred to in linguistic and psycholinguistic publications; the subject index of this introduction can be used to find definitions of a wide range of technical terms. An appendix has been added with further references to some of the core new developments since this book originally appeared.
Author : John Carroll
Publisher :
Page : 456 pages
File Size : 19,93 MB
Release : 1989
Category : Computers
ISBN :
Author : Ronald V. Book
Publisher : Academic Press
Page : 469 pages
File Size : 13,28 MB
Release : 2014-05-10
Category : Mathematics
ISBN : 1483267504
Formal Language Theory: Perspectives and Open Problems focuses on the trends and major open problems on the formal language theory. The selection first ponders on the methods for specifying families of formal languages, open problems about regular languages, and generators of cones and cylinders. Discussions focus on cylinders of algebraic languages, cone of algebraic languages, regularity of noncounting classes, group complexity, specification formalism, and grammars. The publication then elaborates on very small families of algebraic nonrational languages and formal languages and their relation to automata. The book tackles morphisms on free monoids and language theory, homomorphisms, and survey of results and open problems in the mathematical theory of L systems. Topics include single finite substitutions iterated, single homomorphisms iterated, representation of language families, homomorphism equivalence on a language, and problems about infinite words. The selection is a valuable source of data for researchers interested in the formal language theory.
Author : Kamala Krithivasan
Publisher : Pearson Education India
Page : 446 pages
File Size : 43,82 MB
Release : 2009-09
Category : Computable functions
ISBN : 9788131723562
Introduction to Formal Languages, Automata Theory and Computation presents the theoretical concepts in a concise and clear manner, with an in-depth coverage of formal grammar and basic automata types. The book also examines the underlying theory and principles of computation and is highly suitable to the undergraduate courses in computer science and information technology. An overview of the recent trends in the field and applications are introduced at the appropriate places to stimulate the interest of active learners.
Author : Shyamalendu Kandar
Publisher : Pearson Education India
Page : 657 pages
File Size : 27,52 MB
Release : 2013
Category : Formal languages
ISBN : 9332516324
Formal languages and automata theory is the study of abstract machines and how these can be used for solving problems. The book has a simple and exhaustive approach to topics like automata theory, formal languages and theory of computation. These descriptions are followed by numerous relevant examples related to the topic. A brief introductory chapter on compilers explaining its relation to theory of computation is also given.
Author : Michael A. Harrison
Publisher : Addison Wesley Publishing Company
Page : 620 pages
File Size : 25,30 MB
Release : 1978
Category : Computers
ISBN :
Formal language theory was fist developed in the mid 1950's in an attempt to develop theories of natural language acquisition. It was soon realized that this theory (particularly the context-free portion) was quite relevant to the artificial languages that had originated in computer science. Since those days, the theory of formal languages has been developed extensively, and has several discernible trends, which include applications to the syntactic analysis of programming languages, program schemes, models of biological systems, and relationships with natural languages.