Cargando…
Handbook of formal languages. Volume 3. Beyond words /
This third volume of the Handbook of Formal Languages discusses language theory beyond linear or string models: trees, graphs, grids, pictures, computer graphics. Many chapters offer an authoritative self-contained exposition of an entire area. Special emphasis is on interconnections with logic.
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin ; New York :
Springer,
Ã1997.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Ma 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_ocn840292652 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr nn||||||||| | ||
| 008 | 121227s1997 gw a ob 001 0 eng d | ||
| 040 | |a I9W |b eng |e pn |c I9W |d OCLCQ |d UV0 |d OCLCO |d GW5XE |d OCLCF |d OCLCA |d UA@ |d COO |d ORU |d OCLCQ |d EBLCP |d OCLCQ |d YDX |d UAB |d OCLCQ |d LEAUB |d AU@ |d OCLCQ |d REDDC |d K6U |d OCLCO |d OCLCQ |d OCLCO | ||
| 019 | |a 934989178 |a 936313221 |a 968652486 |a 1258911304 |a 1258948624 | ||
| 020 | |a 9783642591266 |q (electronic bk.) | ||
| 020 | |a 3642591264 |q (electronic bk.) | ||
| 020 | |z 9783642638596 |q (print) | ||
| 020 | |z 3642638597 |q (print) | ||
| 020 | |z 3540606491 |q (alk. paper) | ||
| 020 | |z 9783540606499 |q (alk. paper) | ||
| 024 | 7 | |a 10.1007/978-3-642-59126-6 |2 doi | |
| 029 | 1 | |a AU@ |b 000051691459 | |
| 029 | 1 | |a NZ1 |b 14999610 | |
| 029 | 1 | |a NZ1 |b 15588230 | |
| 035 | |a (OCoLC)840292652 |z (OCoLC)934989178 |z (OCoLC)936313221 |z (OCoLC)968652486 |z (OCoLC)1258911304 |z (OCoLC)1258948624 | ||
| 050 | 4 | |a QA267.3 |b .H36 1997 | |
| 082 | 0 | 4 | |a 005.131 |2 23 |
| 049 | |a UAMI | ||
| 245 | 0 | 0 | |a Handbook of formal languages. |n Volume 3. |p Beyond words / |c G. Rozenberg, A. Salomaa (eds.). |
| 246 | 3 | 0 | |a Beyond words |
| 260 | |a Berlin ; |a New York : |b Springer, |c Ã1997. | ||
| 300 | |a 1 online resource (xx, 625 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 | ||
| 520 | |a This third volume of the Handbook of Formal Languages discusses language theory beyond linear or string models: trees, graphs, grids, pictures, computer graphics. Many chapters offer an authoritative self-contained exposition of an entire area. Special emphasis is on interconnections with logic. | ||
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a Of Volume 3 -- 1. Tree Languages -- 1. Introduction -- 2. Trees and terms -- 3. Algebraic preliminaries -- 4. Term rewriting systems -- 5. Finite tree recognizers -- 6. Regular tree grammars -- 7. Tree language operations and closure properties of Rec -- 8. Local tree languages -- 9. A Kleene theorem for tree languages -- 10. Regular tree systems -- 11. Algebraic characterizations of recognizability -- 12. Monadic second-order logic and regular tree languages -- 13. Families of special regular tree languages -- 14. The yield-function and context-free languages -- 15. Context-free tree grammars and pushdown tree recognizers -- 16. Tree transformations and tree transducers -- 17. Composition and decomposition of tree transformations -- 18. Tree transducers with regular look-ahead -- 19. Generalized syntax directed translations -- 20. Surface tree languages -- 21. The hierarchies of surface tree languages and transformational languages -- 22. Some further topics -- References -- 2. Tree-Adjoining Grammars -- 1. Introduction -- 2. Tree-adjoining grammars -- 3. Lexicalized grammars -- 4. 'Lexicalization' of CFGs -- 5. Closure of TAGs under lexicalization -- 6. Summary of lexicalization -- 7. Embedded push-down automaton (EPDA) -- 8. Linguistic relevance -- 9. Some variants of TAGs -- 10. Parsing lexicalized tree-adjoining grammars (LTAG) -- 11 Summary -- References -- 3. Context-Free Graph Grammars -- 1. Introduction -- 2. Node and edge replacement -- 3. Hyperedge replacement grammars -- 4. Node replacement grammars -- 5. Monadic second order logic -- 6. Graph grammars generating strings and trees -- 7. Tree grammars generating graphs -- References -- 4. Two-Dimensional Languages -- 1. Introduction -- 2. Preliminaries -- 3. Regular expressions -- 4. Automata -- 5. Grammars -- 6. Logic formulas -- 7. Tiling systems -- 8. Equivalence theorems -- 9. Properties of recognizable languages -- 10. Recognizable functions -- 11. Beyond finite state recognizability -- References -- 5. Basics of Term Rewriting -- 1. Introduction -- 2. Terms -- 3. Church -- Rosser properties -- 4. Orderings -- 5. Completion -- 6. Rewriting modulo a relation -- 7. Sundries -- References and further reading -- 6.?-Languages -- 1. Introduction -- 2. Topology for languages and?-languages -- 3. The Chomsky hierarchy of?-languages -- 4. Languages and?-languages -- 5. Wagner's hierarchy -- References -- 7. Languages, Automata, and Logic -- 1. Introduction -- 2. Models and formulas -- 3. Automata and MSO-logic on finite words and trees -- 4. First-order definability -- 5. Automata and MSO-logic on infinite words -- 6. Automata and MSO-logic on infinite trees -- References -- 8. Partial Commutation and Traces -- 1. Introduction -- 2. Free partially commutative monoids -- 3. Combinatorial properties -- 4. Recognizable trace languages -- 5. Rational trace languages -- 6. Dependence graphs and logic -- 7. Asynchronous automata -- 8. Infinite traces -- References -- 9. Visual Models of Plant Development -- 1. Introduction -- 2. Developmental models of plant architecture -- 3. Formal description of branching structures -- 4. Fundamentals of modeling using L-systems -- 5. Random factors in development -- 6. Life, death, and reproduction -- 7. Development controlled by endogenous mechanisms -- 8. Development controlled by exogenous mechanisms -- 9. Conclusions -- 10. Acknowledgements -- References -- 10. Digital Images and Formal Languages -- 1. Introduction -- 2. Black and white images and finite automata -- 3. Grayscale images and WFA -- 4. Weighted finite transducers -- 5. Examples of WFT -- References. | |
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Formal languages. | |
| 650 | 6 | |a Langages formels. | |
| 650 | 7 | |a Formal languages |2 fast | |
| 700 | 1 | |a Rozenberg, Grzegorz. | |
| 700 | 1 | |a Salomaa, Arto. | |
| 776 | 0 | 8 | |i Print version: |z 9783642638596 |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3094126 |z Texto completo |
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL3094126 | ||
| 938 | |a YBP Library Services |b YANK |n 13359391 | ||
| 994 | |a 92 |b IZTAP | ||