Automata Theory and Formal Languages:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | |
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
San Diego
Elsevier Science & Technology
2023
|
| Schlagwörter: | |
| Links: | https://doi.org/10.1016/C2021-0-01207-4 https://doi.org/10.1016/C2021-0-01207-4 |
| Abstract: | Front Cover -- Automata Theory and Formal Languages -- Copyright -- Contents -- List of figures -- List of tables -- Biography -- Preface -- 1 Background and fundamentals -- 1.1 Objectives and outcomes -- 1.2 Sets -- 1.2.1 Set operations -- 1.2.2 Set properties -- 1.2.3 Solved examples -- 1.3 Propositions and logic -- 1.3.1 Propositions -- 1.3.2 Logical connectives -- 1.3.3 Solved examples -- 1.4 Relations -- 1.4.1 Properties of relations -- 1.4.2 Solved examples -- 1.5 Automata theory fundamentals -- 1.5.1 Alphabet -- 1.5.2 String -- 1.5.3 Language -- 1.5.4 Solved problems -- 1.6 Need of automata theory and formal languages -- 1.7 Chapter summary -- 1.8 Multiple choice questions -- 1.9 Exercises -- References -- 2 Finite automata and machines -- 2.1 Objectives and outcomes -- 2.2 Finite automation -- 2.3 Introduction to finite automata -- 2.3.1 Finite automata as language acceptor -- 2.4 Types of finite automata -- 2.5 Deterministic finite automata -- 2.5.1 String processing by DFA -- 2.5.2 DFA constructions -- 2.5.3 Complement of DFA -- 2.5.4 Minimization of DFA -- 2.6 Nondeterministic finite automata -- 2.7 NFA to DFA conversion -- 2.8 Finite automata with ε/λ moves -- 2.8.1 Representation of ε-NFA -- 2.8.2 ε/λ closures -- 2.8.3 λ-NFA to DFA conversion -- 2.9 Finite automata with output -- 2.9.1 Mealy machine -- 2.9.2 Moore machine -- 2.9.3 Conversion of Mealy machine to Moore machine -- 2.9.4 Conversion of Moore machine to Mealy machine -- 2.10 Chapter summary -- 2.11 Multiple choice questions -- 2.12 Exercises -- References -- 3 Regular expressions, regular language and grammar -- 3.1 Objectives and outcomes -- 3.2 Regular expressions -- 3.2.1 Properties of regular expressions -- 3.2.2 Simplification of regular expressions -- 3.3 Relationship of finite automata and regular expressions. |
| Beschreibung: | Description based on publisher supplied metadata and other sources |
| Umfang: | 1 Online-Ressource (xxii, 209 Seiten) |
| ISBN: | 9780323917841 |
| DOI: | 10.1016/C2021-0-01207-4 |
Internformat
MARC
| LEADER | 00000nam a22000001c 4500 | ||
|---|---|---|---|
| 001 | BV049335632 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 230921s2023 xx o|||| 00||| eng d | ||
| 020 | |a 9780323917841 |9 978-0-323-91784-1 | ||
| 024 | 7 | |a 10.1016/C2021-0-01207-4 |2 doi | |
| 035 | |a (OCoLC)1401200935 | ||
| 035 | |a (DE-599)BVBBV049335632 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-573 | ||
| 100 | 1 | |a Chavan, Pallavi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Automata Theory and Formal Languages |
| 264 | 1 | |a San Diego |b Elsevier Science & Technology |c 2023 | |
| 300 | |a 1 Online-Ressource (xxii, 209 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Description based on publisher supplied metadata and other sources | ||
| 520 | 3 | |a Front Cover -- Automata Theory and Formal Languages -- Copyright -- Contents -- List of figures -- List of tables -- Biography -- Preface -- 1 Background and fundamentals -- 1.1 Objectives and outcomes -- 1.2 Sets -- 1.2.1 Set operations -- 1.2.2 Set properties -- 1.2.3 Solved examples -- 1.3 Propositions and logic -- 1.3.1 Propositions -- 1.3.2 Logical connectives -- 1.3.3 Solved examples -- 1.4 Relations -- 1.4.1 Properties of relations -- 1.4.2 Solved examples -- 1.5 Automata theory fundamentals -- 1.5.1 Alphabet -- 1.5.2 String -- 1.5.3 Language -- 1.5.4 Solved problems -- 1.6 Need of automata theory and formal languages -- 1.7 Chapter summary -- 1.8 Multiple choice questions -- 1.9 Exercises -- References -- 2 Finite automata and machines -- 2.1 Objectives and outcomes -- 2.2 Finite automation -- 2.3 Introduction to finite automata -- 2.3.1 Finite automata as language acceptor -- 2.4 Types of finite automata -- 2.5 Deterministic finite automata -- 2.5.1 String processing by DFA -- 2.5.2 DFA constructions -- 2.5.3 Complement of DFA -- 2.5.4 Minimization of DFA -- 2.6 Nondeterministic finite automata -- 2.7 NFA to DFA conversion -- 2.8 Finite automata with ε/λ moves -- 2.8.1 Representation of ε-NFA -- 2.8.2 ε/λ closures -- 2.8.3 λ-NFA to DFA conversion -- 2.9 Finite automata with output -- 2.9.1 Mealy machine -- 2.9.2 Moore machine -- 2.9.3 Conversion of Mealy machine to Moore machine -- 2.9.4 Conversion of Moore machine to Mealy machine -- 2.10 Chapter summary -- 2.11 Multiple choice questions -- 2.12 Exercises -- References -- 3 Regular expressions, regular language and grammar -- 3.1 Objectives and outcomes -- 3.2 Regular expressions -- 3.2.1 Properties of regular expressions -- 3.2.2 Simplification of regular expressions -- 3.3 Relationship of finite automata and regular expressions. | |
| 653 | 0 | |a Electronic books | |
| 700 | 1 | |a Jadhav, Ashish |4 ctb | |
| 776 | 0 | |z 9780323917841 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780323917841 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/C2021-0-01207-4 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-33-ESD | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-034596291 | |
| 966 | e | |u https://doi.org/10.1016/C2021-0-01207-4 |l DE-573 |p ZDB-33-ESD |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1818991226893893632 |
|---|---|
| any_adam_object | |
| author | Chavan, Pallavi |
| author2 | Jadhav, Ashish |
| author2_role | ctb |
| author2_variant | a j aj |
| author_facet | Chavan, Pallavi Jadhav, Ashish |
| author_role | aut |
| author_sort | Chavan, Pallavi |
| author_variant | p c pc |
| building | Verbundindex |
| bvnumber | BV049335632 |
| collection | ZDB-33-ESD |
| ctrlnum | (OCoLC)1401200935 (DE-599)BVBBV049335632 |
| doi_str_mv | 10.1016/C2021-0-01207-4 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03100nam a22003731c 4500</leader><controlfield tag="001">BV049335632</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">230921s2023 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780323917841</subfield><subfield code="9">978-0-323-91784-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/C2021-0-01207-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1401200935</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049335632</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-573</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chavan, Pallavi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automata Theory and Formal Languages</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">San Diego</subfield><subfield code="b">Elsevier Science & Technology</subfield><subfield code="c">2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xxii, 209 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Front Cover -- Automata Theory and Formal Languages -- Copyright -- Contents -- List of figures -- List of tables -- Biography -- Preface -- 1 Background and fundamentals -- 1.1 Objectives and outcomes -- 1.2 Sets -- 1.2.1 Set operations -- 1.2.2 Set properties -- 1.2.3 Solved examples -- 1.3 Propositions and logic -- 1.3.1 Propositions -- 1.3.2 Logical connectives -- 1.3.3 Solved examples -- 1.4 Relations -- 1.4.1 Properties of relations -- 1.4.2 Solved examples -- 1.5 Automata theory fundamentals -- 1.5.1 Alphabet -- 1.5.2 String -- 1.5.3 Language -- 1.5.4 Solved problems -- 1.6 Need of automata theory and formal languages -- 1.7 Chapter summary -- 1.8 Multiple choice questions -- 1.9 Exercises -- References -- 2 Finite automata and machines -- 2.1 Objectives and outcomes -- 2.2 Finite automation -- 2.3 Introduction to finite automata -- 2.3.1 Finite automata as language acceptor -- 2.4 Types of finite automata -- 2.5 Deterministic finite automata -- 2.5.1 String processing by DFA -- 2.5.2 DFA constructions -- 2.5.3 Complement of DFA -- 2.5.4 Minimization of DFA -- 2.6 Nondeterministic finite automata -- 2.7 NFA to DFA conversion -- 2.8 Finite automata with ε/λ moves -- 2.8.1 Representation of ε-NFA -- 2.8.2 ε/λ closures -- 2.8.3 λ-NFA to DFA conversion -- 2.9 Finite automata with output -- 2.9.1 Mealy machine -- 2.9.2 Moore machine -- 2.9.3 Conversion of Mealy machine to Moore machine -- 2.9.4 Conversion of Moore machine to Mealy machine -- 2.10 Chapter summary -- 2.11 Multiple choice questions -- 2.12 Exercises -- References -- 3 Regular expressions, regular language and grammar -- 3.1 Objectives and outcomes -- 3.2 Regular expressions -- 3.2.1 Properties of regular expressions -- 3.2.2 Simplification of regular expressions -- 3.3 Relationship of finite automata and regular expressions.</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronic books</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jadhav, Ashish</subfield><subfield code="4">ctb</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="z">9780323917841</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780323917841</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/C2021-0-01207-4</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034596291</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1016/C2021-0-01207-4</subfield><subfield code="l">DE-573</subfield><subfield code="p">ZDB-33-ESD</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV049335632 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T20:06:54Z |
| institution | BVB |
| isbn | 9780323917841 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034596291 |
| oclc_num | 1401200935 |
| open_access_boolean | |
| owner | DE-573 |
| owner_facet | DE-573 |
| physical | 1 Online-Ressource (xxii, 209 Seiten) |
| psigel | ZDB-33-ESD |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | Elsevier Science & Technology |
| record_format | marc |
| spelling | Chavan, Pallavi Verfasser aut Automata Theory and Formal Languages San Diego Elsevier Science & Technology 2023 1 Online-Ressource (xxii, 209 Seiten) txt rdacontent c rdamedia cr rdacarrier Description based on publisher supplied metadata and other sources Front Cover -- Automata Theory and Formal Languages -- Copyright -- Contents -- List of figures -- List of tables -- Biography -- Preface -- 1 Background and fundamentals -- 1.1 Objectives and outcomes -- 1.2 Sets -- 1.2.1 Set operations -- 1.2.2 Set properties -- 1.2.3 Solved examples -- 1.3 Propositions and logic -- 1.3.1 Propositions -- 1.3.2 Logical connectives -- 1.3.3 Solved examples -- 1.4 Relations -- 1.4.1 Properties of relations -- 1.4.2 Solved examples -- 1.5 Automata theory fundamentals -- 1.5.1 Alphabet -- 1.5.2 String -- 1.5.3 Language -- 1.5.4 Solved problems -- 1.6 Need of automata theory and formal languages -- 1.7 Chapter summary -- 1.8 Multiple choice questions -- 1.9 Exercises -- References -- 2 Finite automata and machines -- 2.1 Objectives and outcomes -- 2.2 Finite automation -- 2.3 Introduction to finite automata -- 2.3.1 Finite automata as language acceptor -- 2.4 Types of finite automata -- 2.5 Deterministic finite automata -- 2.5.1 String processing by DFA -- 2.5.2 DFA constructions -- 2.5.3 Complement of DFA -- 2.5.4 Minimization of DFA -- 2.6 Nondeterministic finite automata -- 2.7 NFA to DFA conversion -- 2.8 Finite automata with ε/λ moves -- 2.8.1 Representation of ε-NFA -- 2.8.2 ε/λ closures -- 2.8.3 λ-NFA to DFA conversion -- 2.9 Finite automata with output -- 2.9.1 Mealy machine -- 2.9.2 Moore machine -- 2.9.3 Conversion of Mealy machine to Moore machine -- 2.9.4 Conversion of Moore machine to Mealy machine -- 2.10 Chapter summary -- 2.11 Multiple choice questions -- 2.12 Exercises -- References -- 3 Regular expressions, regular language and grammar -- 3.1 Objectives and outcomes -- 3.2 Regular expressions -- 3.2.1 Properties of regular expressions -- 3.2.2 Simplification of regular expressions -- 3.3 Relationship of finite automata and regular expressions. Electronic books Jadhav, Ashish ctb 9780323917841 Erscheint auch als Druck-Ausgabe 9780323917841 https://doi.org/10.1016/C2021-0-01207-4 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Chavan, Pallavi Automata Theory and Formal Languages |
| title | Automata Theory and Formal Languages |
| title_auth | Automata Theory and Formal Languages |
| title_exact_search | Automata Theory and Formal Languages |
| title_full | Automata Theory and Formal Languages |
| title_fullStr | Automata Theory and Formal Languages |
| title_full_unstemmed | Automata Theory and Formal Languages |
| title_short | Automata Theory and Formal Languages |
| title_sort | automata theory and formal languages |
| url | https://doi.org/10.1016/C2021-0-01207-4 |
| work_keys_str_mv | AT chavanpallavi automatatheoryandformallanguages AT jadhavashish automatatheoryandformallanguages |