Screen LibraryFormal language theory : perspectives and open problems /
Saved in:
| Corporate Authors: | |
|---|---|
| Group Author: | |
| Published: |
Academic Press,
|
| Publisher Address: | New York : |
| Publication Dates: | 1980. |
| Literature type: | eBook |
| Language: | English |
| Subjects: | |
| Online Access: |
http://www.sciencedirect.com/science/book/9780121153502 |
| Item Description: | Proceedings of a conference held Dec. 10-14, 1979, in Santa Barbara, Calif. |
| Carrier Form: | 1 online resource (xiii, 454 pages) : illustrations |
| Bibliography: | Includes bibliographical references. |
| ISBN: |
9781483267500 1483267504 |
| Index Number: | QA267 |
| CLC: | O141 |
| Contents: |
Front Cover; Formal Language Theory: Perspectives and Open Problems; Copyright Page; Table of Contents; LIST OF CONTRIBUTORS; PREFACE; ACKNOWLEDGMENTS; CHAPTER 1. METHODS FOR SPECIFYING FAMILIES OF FORMAL LANGUAGES -- PAST-PRESENT-FUTURE; I. INTRODUCTION; II. ORIGINS; III. SPECIFICATION FORMALISM; IV. GRAMMARS; V. CONCLUSIONS; REFERENCES; CHAPTER 2. OPEN PROBLEMS ABOUT REGULAR LANGUAGES; I. INTRODUCTION; II. STAR HEIGHT; III. RESTRICTED STAR HEIGHT; IV. GROUP COMPLEXITY; V. STAR REMOVAL; VI. REGULARITY OF NONCOUNTING CLASSES; VII. OPTIMALITY OF PREFIX CODES; VIII. CONCLUDING REMARKS. Acknowledgmentreferences; chapter 3. generators of cones and cylinders; i. preliminaries; ii. the cone of algebraic languages; iii. cylinders of algebraic languages; iv. conclusion; references; chapter 4. very small families of algebraic nonrational languages; i. languages that are nearly regular; ii. minimal cones; iii. the decreasing hierarchy; references; chapter 5. formal languages and their relation to automata:what hopcroft & ullman didn't tell us; i. introduction; ii. coordinate-free automata; iii. pushdown automata; iv. turing machines; v. conclusions; references. Chapter 6. morphisms on free monoids and language theoryi. thue and lindenmayer; ii. problems about infinite words; iii. equality sets; references; chapter 7. homomorphisms: decidability, equality and test sets; i. introduction; ii. iterated homomorphisms; iii. homomorphism equivalence on a language; iv. elementary homomorphisms and equality sets; v. homomorphism compatibility; vi. test sets and checking words; vii. representation of language families; references; chapter 8. a survey of results and open problems in the mathematical theory of l systems; introduction. I. single homomorphisms iteratedii. single finite substitutions iterated; iii. several homomorphisms iterated; iv. several finite substitutions iterated; v. the relationship to other classes of languages; vi. discussion; acknowledgments; references; chapter 9. some open questions and recent results on tree transducers and tree languages; i. introduction; ii. tree transducers and tree grammars; iii. attribute grammars as tree transducers; iv. computation trees of alternating automata; v. the equivalence problem for deterministic tree transducers; vi. conclusion; acknowledgments; references. CHAPTER 10. THE INTERFACE BETWEEN LANGUAGE THEORY AND COMPLEXITY THEORYI. INTRODUCTION; II. COMPLETE PROBLEMS AND CHARACTERIZATION THEOREMS; III. SEPARATION AND CONTAINMENT RESULTS; REFERENCES; CHAPTER 11. Pattern Matching in Strings; I. INTRODUCTION; II. PATTERN-MATCHING PROBLEMS; III. MATCHING FINITE SETS OF KEYWORDS; IV. MATCHING REGULAR EXPRESSIONS; V. MATCHING REGULAR EXPRESSIONS WITH BACK REFERENCING; VI. CONCLUSIONS; ACKNOWLEDGMENTS; REFERENCES; CHAPTER 12. Equations and Rewrite Rules; 1. Introduction; 2. Sorted Algebras; 3. Equations and Varieties; 4. Proof Theory. |