Automata Theory and Formal Languages / / Wladyslaw Homenda, Witold Pedrycz.
The book is a concise, self-contained and fully updated introduction to automata theory – a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explana...
Saved in:
| Superior document: | Title is part of eBook package: De Gruyter DG Plus DeG Package 2022 Part 1 |
|---|---|
| VerfasserIn: | |
| Place / Publishing House: | Berlin ;, Boston : : De Gruyter, , [2022] ©2022 |
| Year of Publication: | 2022 |
| Language: | English |
| Series: | De Gruyter Textbook
|
| Online Access: | |
| Physical Description: | 1 online resource (XIV, 232 p.) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
9783110752304 |
|---|---|
| ctrlnum |
(DE-B1597)583611 (OCoLC)1294426809 |
| collection |
bib_alma |
| record_format |
marc |
| spelling |
Homenda, Wladyslaw, author. aut http://id.loc.gov/vocabulary/relators/aut Automata Theory and Formal Languages / Wladyslaw Homenda, Witold Pedrycz. Berlin ; Boston : De Gruyter, [2022] ©2022 1 online resource (XIV, 232 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda De Gruyter Textbook Frontmatter -- Foreword -- Preface -- Contents -- 1 Preliminaries -- Part I: Grammars and generating languages -- 2 Regular expressions and regular languages -- 3 Context-free grammars -- 4 Context-sensitive grammars and unrestricted grammars -- Part II: Automata and accepting languages -- 5 Turing machines -- 6 Pushdown automata -- 7 Finite automata -- Part III: Revisited: languages, grammars, automata -- 8 Grammars versus automata -- 9 Around the hierarchy of languages -- Bibliography -- Index restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star The book is a concise, self-contained and fully updated introduction to automata theory – a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students. Issued also in print. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 02. Mai 2023) Automaten. Digitale Systeme. Formale Sprachen. Turing Maschinen. COMPUTERS / Information Theory. bisacsh Pedrycz, Witold, author. aut http://id.loc.gov/vocabulary/relators/aut Title is part of eBook package: De Gruyter DG Plus DeG Package 2022 Part 1 9783110766820 Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2022 English 9783110993899 Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2022 9783110994810 ZDB-23-DGG Title is part of eBook package: De Gruyter EBOOK PACKAGE Engineering, Computer Sciences 2022 English 9783110994223 Title is part of eBook package: De Gruyter EBOOK PACKAGE Engineering, Computer Sciences 2022 9783110994193 ZDB-23-DEI EPUB 9783110752311 print 9783110752274 https://doi.org/10.1515/9783110752304 https://www.degruyter.com/isbn/9783110752304 Cover https://www.degruyter.com/document/cover/isbn/9783110752304/original |
| language |
English |
| format |
eBook |
| author |
Homenda, Wladyslaw, Homenda, Wladyslaw, Pedrycz, Witold, |
| spellingShingle |
Homenda, Wladyslaw, Homenda, Wladyslaw, Pedrycz, Witold, Automata Theory and Formal Languages / De Gruyter Textbook Frontmatter -- Foreword -- Preface -- Contents -- 1 Preliminaries -- Part I: Grammars and generating languages -- 2 Regular expressions and regular languages -- 3 Context-free grammars -- 4 Context-sensitive grammars and unrestricted grammars -- Part II: Automata and accepting languages -- 5 Turing machines -- 6 Pushdown automata -- 7 Finite automata -- Part III: Revisited: languages, grammars, automata -- 8 Grammars versus automata -- 9 Around the hierarchy of languages -- Bibliography -- Index |
| author_facet |
Homenda, Wladyslaw, Homenda, Wladyslaw, Pedrycz, Witold, Pedrycz, Witold, Pedrycz, Witold, |
| author_variant |
w h wh w h wh w p wp |
| author_role |
VerfasserIn VerfasserIn VerfasserIn |
| author2 |
Pedrycz, Witold, Pedrycz, Witold, |
| author2_variant |
w p wp |
| author2_role |
VerfasserIn VerfasserIn |
| author_sort |
Homenda, Wladyslaw, |
| title |
Automata Theory and Formal Languages / |
| title_full |
Automata Theory and Formal Languages / Wladyslaw Homenda, Witold Pedrycz. |
| title_fullStr |
Automata Theory and Formal Languages / Wladyslaw Homenda, Witold Pedrycz. |
| title_full_unstemmed |
Automata Theory and Formal Languages / Wladyslaw Homenda, Witold Pedrycz. |
| title_auth |
Automata Theory and Formal Languages / |
| title_alt |
Frontmatter -- Foreword -- Preface -- Contents -- 1 Preliminaries -- Part I: Grammars and generating languages -- 2 Regular expressions and regular languages -- 3 Context-free grammars -- 4 Context-sensitive grammars and unrestricted grammars -- Part II: Automata and accepting languages -- 5 Turing machines -- 6 Pushdown automata -- 7 Finite automata -- Part III: Revisited: languages, grammars, automata -- 8 Grammars versus automata -- 9 Around the hierarchy of languages -- Bibliography -- Index |
| title_new |
Automata Theory and Formal Languages / |
| title_sort |
automata theory and formal languages / |
| series |
De Gruyter Textbook |
| series2 |
De Gruyter Textbook |
| publisher |
De Gruyter, |
| publishDate |
2022 |
| physical |
1 online resource (XIV, 232 p.) Issued also in print. |
| contents |
Frontmatter -- Foreword -- Preface -- Contents -- 1 Preliminaries -- Part I: Grammars and generating languages -- 2 Regular expressions and regular languages -- 3 Context-free grammars -- 4 Context-sensitive grammars and unrestricted grammars -- Part II: Automata and accepting languages -- 5 Turing machines -- 6 Pushdown automata -- 7 Finite automata -- Part III: Revisited: languages, grammars, automata -- 8 Grammars versus automata -- 9 Around the hierarchy of languages -- Bibliography -- Index |
| isbn |
9783110752304 9783110766820 9783110993899 9783110994810 9783110994223 9783110994193 9783110752311 9783110752274 |
| url |
https://doi.org/10.1515/9783110752304 https://www.degruyter.com/isbn/9783110752304 https://www.degruyter.com/document/cover/isbn/9783110752304/original |
| illustrated |
Not Illustrated |
| doi_str_mv |
10.1515/9783110752304 |
| oclc_num |
1294426809 |
| work_keys_str_mv |
AT homendawladyslaw automatatheoryandformallanguages AT pedryczwitold automatatheoryandformallanguages |
| status_str |
n |
| ids_txt_mv |
(DE-B1597)583611 (OCoLC)1294426809 |
| carrierType_str_mv |
cr |
| hierarchy_parent_title |
Title is part of eBook package: De Gruyter DG Plus DeG Package 2022 Part 1 Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2022 English Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2022 Title is part of eBook package: De Gruyter EBOOK PACKAGE Engineering, Computer Sciences 2022 English Title is part of eBook package: De Gruyter EBOOK PACKAGE Engineering, Computer Sciences 2022 |
| is_hierarchy_title |
Automata Theory and Formal Languages / |
| container_title |
Title is part of eBook package: De Gruyter DG Plus DeG Package 2022 Part 1 |
| author2_original_writing_str_mv |
noLinkedField noLinkedField |
| _version_ |
1806144566151086080 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04241nam a22008175i 4500</leader><controlfield tag="001">9783110752304</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20230502090707.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">230502t20222022gw fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110752304</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9783110752304</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)583611</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1294426809</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM031000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Homenda, Wladyslaw, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automata Theory and Formal Languages /</subfield><subfield code="c">Wladyslaw Homenda, Witold Pedrycz.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ;</subfield><subfield code="a">Boston : </subfield><subfield code="b">De Gruyter, </subfield><subfield code="c">[2022]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2022</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (XIV, 232 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">De Gruyter Textbook</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Foreword -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">1 Preliminaries -- </subfield><subfield code="t">Part I: Grammars and generating languages -- </subfield><subfield code="t">2 Regular expressions and regular languages -- </subfield><subfield code="t">3 Context-free grammars -- </subfield><subfield code="t">4 Context-sensitive grammars and unrestricted grammars -- </subfield><subfield code="t">Part II: Automata and accepting languages -- </subfield><subfield code="t">5 Turing machines -- </subfield><subfield code="t">6 Pushdown automata -- </subfield><subfield code="t">7 Finite automata -- </subfield><subfield code="t">Part III: Revisited: languages, grammars, automata -- </subfield><subfield code="t">8 Grammars versus automata -- </subfield><subfield code="t">9 Around the hierarchy of languages -- </subfield><subfield code="t">Bibliography -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The book is a concise, self-contained and fully updated introduction to automata theory – a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 02. Mai 2023)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automaten.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Digitale Systeme.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formale Sprachen.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turing Maschinen.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Information Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pedrycz, Witold, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">DG Plus DeG Package 2022 Part 1</subfield><subfield code="z">9783110766820</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE COMPLETE 2022 English</subfield><subfield code="z">9783110993899</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE COMPLETE 2022</subfield><subfield code="z">9783110994810</subfield><subfield code="o">ZDB-23-DGG</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE Engineering, Computer Sciences 2022 English</subfield><subfield code="z">9783110994223</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE Engineering, Computer Sciences 2022</subfield><subfield code="z">9783110994193</subfield><subfield code="o">ZDB-23-DEI</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">EPUB</subfield><subfield code="z">9783110752311</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9783110752274</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9783110752304</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9783110752304</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9783110752304/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-076682-0 DG Plus DeG Package 2022 Part 1</subfield><subfield code="b">2022</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-099389-9 EBOOK PACKAGE COMPLETE 2022 English</subfield><subfield code="b">2022</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-099422-3 EBOOK PACKAGE Engineering, Computer Sciences 2022 English</subfield><subfield code="b">2022</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_DGALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DEI</subfield><subfield code="b">2022</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield><subfield code="b">2022</subfield></datafield></record></collection> |