
- 468 pages
- English
- PDF
- Available on iOS & Android
About this book
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.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of 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
- CHAPTER 2. OPEN PROBLEMS ABOUT REGULAR LANGUAGES
- CHAPTER 3. GENERATORS OF CONES AND CYLINDERS
- CHAPTER 4. VERY SMALL FAMILIES OF ALGEBRAIC NONRATIONAL LANGUAGES
- CHAPTER 5. FORMAL LANGUAGES AND THEIR RELATION TO AUTOMATA:WHAT HOPCROFT & ULLMAN DIDN'T TELL US
- CHAPTER 6. MORPHISMS ON FREE MONOIDS AND LANGUAGE THEORY
- CHAPTER 7. HOMOMORPHISMS: DECIDABILITY, EQUALITY AND TEST SETS
- CHAPTER 8. A SURVEY OF RESULTS AND OPEN PROBLEMS IN THE MATHEMATICAL THEORY OF L SYSTEMS
- CHAPTER 9. SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES
- CHAPTER 10. THE INTERFACE BETWEEN LANGUAGE THEORY AND COMPLEXITY THEORY
- CHAPTER 11. Pattern Matching in Strings
- CHAPTER 12. Equations and Rewrite Rules
- CHAPTER 13. APPLICATION OF FORMAL LANGUAGE THEORY TO PROBLEMS OF SECURITY AND SYNCHRONIZATION