The theory of formal languages is widely accepted as the backbone of theoretical computer science. It mainly originated from mathematics (combinatorics, algebra, mathematical logic) and generative linguistics. All human problem solving capabilities can be considered in a certain sense as a manipulation of symbols and structures composed by symbols, which is actually the stem of formal language theory. Language — in its two basic forms, natural and artificial — is a particular case of a symbol system.

The contributors present the main results and techniques of their areas of specialization in an easily accessible way accompanied with many references having a multiple role: historical, hints for complete proofs or solutions to exercises, directions for further research where the reader may identify attractive problems. This volume contains areas, mainly applications, which have not appeared in any collection of this type. We believe that the volume representing "a gate to formal language theory and its applications", will be also useful as a general source of information in computation theory, both at the undergraduate and research level.

Customer Reviews

Be the first to write a review!
From the Publisher

The theory of formal languages is widely accepted as the backbone of theoretical computer science. It mainly originated from mathematics (combinatorics, algebra, mathematical logic) and generative linguistics. All human problem solving capabilities can be considered in a certain sense as a manipulation of symbols and structures composed by symbols, which is actually the stem of formal language theory. Language — in its two basic forms, natural and artificial — is a particular case of a symbol system.

The contributors present the main results and techniques of their areas of specialization in an easily accessible way accompanied with many references having a multiple role: historical, hints for complete proofs or solutions to exercises, directions for further research where the reader may identify attractive problems. This volume contains areas, mainly applications, which have not appeared in any collection of this type. We believe that the volume representing "a gate to formal language theory and its applications", will be also useful as a general source of information in computation theory, both at the undergraduate and research level.



Product Details

* ISBN: 3540334602
* ISBN-13: 9783540334606
* Format: Other Format, 373pp
* Publisher: Springer-Verlag New York, LLC
* Pub. Date: September 2006
* Series: Studies in Computational Intelligence

* Table of Contents

Table of Contents
1 Basic notation and terminology 1
2 Topics in asynchronous circuit theory 11
3 Text searching and indexing 43
4 Quantum finite automata 81
5 Splicing and regularity 119
6 Combinatorial complexity measures for strings 149
7 Image processing using finite automata 171
8 Mathematical foundations of learning theory 209
9 Some essentials of graph transformation 229
10 Molecular computation 255
11 Restarting automata 269
12 Computable lower bounds for Busy Beaver turing machines 305
13 Introduction to unification grammars 321
14 Introduction to Petri net theory 343
More by This Author
loading animation loading...
Related Subjects

* Science
* Computers - General & Miscellaneous
* Engineering

Search Related Categories

Nonfiction

* Formal languages