A course in formal languages, automata and groups
Based on the author s lecture notes for an MSc course, this text combines formal language and automata theory and group theory, a thriving research area that has developed extensively over the last twenty-five years. The aim of the first three chapters is to give a rigorous proof that various notion...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
London :
Springer London
[20..].
Cham : Springer Nature |
| Series: | Universitext
|
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Description d'après consultation du 16 mars 2012 Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • A course in formal languages, automata and groups, Ian Chiswell, London, Springer, 2009, 1 vol. (IX-157 p.), Universitext, 978-1-84800-939-4 |
| LEADER | 03901nam a22003857a 4500 | ||
|---|---|---|---|
| 001 | 940960 | ||
| 008 | 090210q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN131118137 | ||
| 020 | |a 9781848009400 | ||
| 020 | |a 9781848009400 | ||
| 041 | 0 | |a eng | |
| 082 | |a 512.2 | ||
| 084 | |a 03D10. 2000 | ||
| 084 | |a 03D20. 2000 | ||
| 084 | |a 20F10. 2000 | ||
| 100 | 1 | |a Chiswell, Ian, |d 1948- | |
| 245 | 1 | 0 | |a A course in formal languages, automata and groups |c Ian Chiswell. |
| 260 | |a London : |b Springer London. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Universitext | |
| 500 | |a Description d'après consultation du 16 mars 2012 | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 504 | |a Bibliogr. Index | ||
| 505 | 1 | |a Preface Contents 1. Grammars and Machine Recognition 2. Recursive Functions 3. Recursively Enumerable Sets and Languages 4. Context-free language 5. Connections with Group Theory A. Results and Proofs Omitted in the Text B. The Halting Problem and Universal Turing Machines C. Cantor's Diagonal Argument D. Solutions to Selected Exercises References Index | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a Based on the author s lecture notes for an MSc course, this text combines formal language and automata theory and group theory, a thriving research area that has developed extensively over the last twenty-five years. The aim of the first three chapters is to give a rigorous proof that various notions of recursively enumerable language are equivalent. Chapter One begins with languages defined by Chomsky grammars and the idea of machine recognition, contains a discussion of Turing Machines, and includes work on finite state automata and the languages they recognise. The following chapters then focus on topics such as recursive functions and predicates; recursively enumerable sets of natural numbers; and the group-theoretic connections of language theory, including a brief introduction to automatic groups. Highlights include: A comprehensive study of context-free languages and pushdown automata in Chapter Four, in particular a clear and complete account of the connection between LR(k) languages and deterministic context-free languages. A self-contained discussion of the significant Muller-Schupp result on context-free groups. Enriched with precise definitions, clear and succinct proofs and worked examples, the book is aimed primarily at postgraduate students in mathematics but will also be of great interest to researchers in mathematics and computer science who want to learn more about the interplay between group theory and formal languages. A solutions manual is available to instructors via www.springer.com | ||
| 776 | 0 | |0 13241273X |t A course in formal languages, automata and groups |f Ian Chiswell |c London |n Springer |d 2009 |p 1 vol. (IX-157 p.) |s Universitext |z 978-1-84800-939-4 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-1-84800-940-0 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-4L071RDP-3 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747852049 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/978-1-84800-940-0 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750869631 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/978-1-84800-940-0 |z Accès INSA CVL | |
| 997 | |0 940960 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||