Cargando…

Formal language theory : perspectives and open problems /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Otros Autores: Book, Ronald V. (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York : Academic Press, 1980.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000 i 4500
001 SCIDIR_ocn893627735
003 OCoLC
005 20231120111823.0
006 m o d
007 cr cnu---unuuu
008 141023s1980 nyua ob 000 0 eng d
040 |a OPELS  |b eng  |e rda  |e pn  |c OPELS  |d N$T  |d EBLCP  |d DEBSZ  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCL  |d OCLCO  |d YDXCP  |d MERUC  |d OCLCQ  |d OCLCE  |d OCLCA  |d UKAHL  |d INARC  |d OCLCQ  |d LUN  |d OCLCQ  |d COM  |d OCLCO  |d OCLCQ  |d OCLCO 
019 |a 898103034  |a 948674847  |a 1083537311  |a 1100854525  |a 1149210114 
020 |a 9781483267500  |q (electronic bk.) 
020 |a 1483267504  |q (electronic bk.) 
020 |z 9780121153502 
020 |z 0121153509 
035 |a (OCoLC)893627735  |z (OCoLC)898103034  |z (OCoLC)948674847  |z (OCoLC)1083537311  |z (OCoLC)1100854525  |z (OCoLC)1149210114 
042 |a dlr 
050 4 |a QA267.3 
072 7 |a MAT  |x 000000  |2 bisacsh 
082 0 4 |a 511.3  |2 22 
084 |a 54.10  |2 bcl 
084 |a ES 920  |2 rvk 
084 |a SD 1979  |2 rvk 
245 0 0 |a Formal language theory :  |b perspectives and open problems /  |c edited by Ronald V. Book. 
264 1 |a New York :  |b Academic Press,  |c 1980. 
300 |a 1 online resource (xiii, 454 pages) :  |b illustrations 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
500 |a Proceedings of a conference held Dec. 10-14, 1979, in Santa Barbara, Calif. 
504 |a Includes bibliographical references. 
588 0 |a Print version record. 
505 0 |a 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. 
505 8 |a 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. 
505 8 |a 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. 
505 8 |a 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. 
505 8 |a 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. 
506 |3 Use copy  |f Restrictions unspecified  |2 star  |5 MiAaHDL 
533 |a Electronic reproduction.  |b [Place of publication not identified] :  |c HathiTrust Digital Library,  |d 2011.  |5 MiAaHDL 
538 |a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.  |u http://purl.oclc.org/DLF/benchrepro0212  |5 MiAaHDL 
583 1 |a digitized  |c 2011  |h HathiTrust Digital Library  |l committed to preserve  |2 pda  |5 MiAaHDL 
650 0 |a Formal languages  |v Congresses. 
650 6 |a Langages formels  |0 (CaQQLa)201-0025413  |v Congr�es.  |0 (CaQQLa)201-0378219 
650 7 |a MATHEMATICS  |x General.  |2 bisacsh 
650 7 |a Formal languages  |2 fast  |0 (OCoLC)fst00932922 
650 7 |a Formale Sprache  |2 gnd  |0 (DE-588)4017848-1 
650 7 |a Theorie  |2 gnd  |0 (DE-588)4059787-8 
650 1 7 |a Formele talen.  |2 gtt 
655 2 |a Congress  |0 (DNLM)D016423 
655 7 |a proceedings (reports)  |2 aat  |0 (CStmoGRI)aatgf300027316 
655 7 |a Conference papers and proceedings  |2 fast  |0 (OCoLC)fst01423772 
655 7 |a Conference papers and proceedings.  |2 lcgft 
655 7 |a Actes de congr�es.  |2 rvmgf  |0 (CaQQLa)RVMGF-000001049 
700 1 |a Book, Ronald V.,  |e editor. 
776 0 8 |i Print version:  |t Formal language theory  |z 0121153509  |w (DLC) 80022435  |w (OCoLC)6761669 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/book/9780121153502  |z Texto completo