An Introduction to Formal Language Theory by James Pustejovsky
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.-
The Science of Programming
-
A Theory of Objects
-
Numerical Geometry of Non-Rigid Shapes
-
Computer Systems
-
Algebraic Approaches to Program Semantics
-
Set Theory for Computing
-
Beauty Is Our Business
-
Parameterized Complexity
-
A Discipline of Multiprogramming
-
Asynchronous Circuits
-
The Design of Well-Structured and Correct Programs
-
String-Rewriting Systems
-
Error-Free Polynomial Matrix Computations
-
Prototyping-Oriented Software Development
-
The Synthesizer Generator
-
Methods and Applications of Error-Free Computation
-
Adaptive Information Processing
-
Reliable Computer Systems
-
Programming with Sets
-
Programming in Modula-2
-
Adaptive Signal Processing
-
Predicate Calculus and Program Semantics
-
Algorithmic Algebra
-
Programming with Specifications
-
Probabilistic Analysis of Algorithms
-
Expert Systems and Probabilistic Network Models
-
Algorithmic Language and Program Development
-
Object-Oriented Database Programming
-
The Design and Analysis of Algorithms
-
Software Configuration Management Using Vesta
-
The Origins of Digital Computers
-
Larch: Languages and Tools for Formal Specification
-
What Computing Is All About
-
ML with Concurrency
-
The Synthesizer Generator Reference Manual
-
Language Equations
-
On a Method of Multiprogramming
-
Programming Methodology
-
Abstraction, Refinement and Proof for Probabilistic Systems
-
Super-Recursive Algorithms
-
Specification and Development of Interactive Systems
-
Geometric Fundamentals of Robotics
-
Evolutionary Synthesis of Pattern Recognition Systems
-
Reverse Engineering of Object Oriented Code
-
High Performance Discovery In Time Series
-
Panoramic Vision
Michael Arbib is a professor of computer and information science, and director of the Center for Systems Neuroscience and the Laboratory for Perpetual Robotics, at the University of Massachusetts, Amherst. His books include Brains, Machines, and Mathematics: The Metaphorical Brain: and Computers and the Cybernetic Society.
| SKU | Unavailable |
| ISBN 13 | 9781461395973 |
| ISBN 10 | 1461395976 |
| Title | An Introduction to Formal Language Theory |
| Author | James Pustejovsky |
| Series | Monographs In Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer-Verlag New York Inc. |
| Year published | 2012-03-02 |
| Number of pages | 203 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |