Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cham
Springer International Publishing
2022
Cham Springer |
| Ausgabe: | 1st ed. 2022 |
| Schriftenreihe: | Undergraduate Topics in Computer Science
|
| Schlagworte: | |
| Online-Zugang: | BTU01 FHA01 FHD01 FHI01 FHM01 FHN01 FHR01 FKE01 FLA01 FRO01 FWS01 FWS02 HTW01 UBA01 UBG01 UBM01 UBR01 UBT01 UBW01 UBY01 UEI01 UER01 UPA01 Volltext |
| Beschreibung: | 1 Online-Ressource (VIII, 280 p. 91 illus) |
| ISBN: | 9783031119651 |
| ISSN: | 2197-1781 |
| DOI: | 10.1007/978-3-031-11965-1 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV048456074 | ||
| 003 | DE-604 | ||
| 005 | 20231129 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 220906s2022 |||| o||u| ||||||eng d | ||
| 020 | |a 9783031119651 |c Online |9 978-3-031-11965-1 | ||
| 024 | 7 | |a 10.1007/978-3-031-11965-1 |2 doi | |
| 035 | |a (ZDB-2-SCS)9783031119651 | ||
| 035 | |a (OCoLC)1344265557 | ||
| 035 | |a (DE-599)BVBBV048456074 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-860 |a DE-19 |a DE-Aug4 |a DE-898 |a DE-861 |a DE-188 |a DE-523 |a DE-859 |a DE-473 |a DE-29 |a DE-863 |a DE-1050 |a DE-20 |a DE-862 |a DE-92 |a DE-355 |a DE-824 |a DE-384 |a DE-M347 |a DE-573 |a DE-703 |a DE-706 |a DE-739 |a DE-634 | ||
| 082 | 0 | |a 005.131 |2 23 | |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 084 | |a DAT 000 |2 stub | ||
| 100 | 1 | |a Pettorossi, Alberto |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Automata Theory and Formal Languages |b Fundamental Notions, Theorems, and Techniques |c by Alberto Pettorossi |
| 250 | |a 1st ed. 2022 | ||
| 264 | 1 | |a Cham |b Springer International Publishing |c 2022 | |
| 264 | 1 | |a Cham |b Springer | |
| 300 | |a 1 Online-Ressource (VIII, 280 p. 91 illus) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Undergraduate Topics in Computer Science |x 2197-1781 | |
| 650 | 4 | |a Formal Languages and Automata Theory | |
| 650 | 4 | |a Computer Science Logic and Foundations of Programming | |
| 650 | 4 | |a Computability and Recursion Theory | |
| 650 | 4 | |a Theory and Algorithms for Application Domains | |
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Computable functions | |
| 650 | 4 | |a Recursion theory | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-031-11964-4 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-031-11966-8 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-11965-1 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2022 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-033834129 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l BTU01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l FHA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l FHD01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l FHI01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l FHM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l FHN01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l FHR01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l FKE01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l FLA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l FRO01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l FWS01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l FWS02 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l HTW01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l UBA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l UBG01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l UBM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l UBR01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l UBT01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l UBW01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l UBY01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l UEI01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l UER01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-031-11965-1 |l UPA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
Datensatz im Suchindex
| DE-BY-FWS_katkey | 1004253 |
|---|---|
| _version_ | 1806174278000836608 |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Pettorossi, Alberto |
| author_facet | Pettorossi, Alberto |
| author_role | aut |
| author_sort | Pettorossi, Alberto |
| author_variant | a p ap |
| building | Verbundindex |
| bvnumber | BV048456074 |
| classification_rvk | ST 136 |
| classification_tum | DAT 000 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)9783031119651 (OCoLC)1344265557 (DE-599)BVBBV048456074 |
| dewey-full | 005.131 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.131 |
| dewey-search | 005.131 |
| dewey-sort | 15.131 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-3-031-11965-1 |
| edition | 1st ed. 2022 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04160nmm a2200781zc 4500</leader><controlfield tag="001">BV048456074</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20231129 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">220906s2022 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783031119651</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-031-11965-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-031-11965-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)9783031119651</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1344265557</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV048456074</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-860</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-1050</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.131</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 136</subfield><subfield code="0">(DE-625)143591:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pettorossi, Alberto</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><subfield code="b">Fundamental Notions, Theorems, and Techniques</subfield><subfield code="c">by Alberto Pettorossi</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2022</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer International Publishing</subfield><subfield code="c">2022</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 280 p. 91 illus)</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="490" ind1="0" ind2=" "><subfield code="a">Undergraduate Topics in Computer Science</subfield><subfield code="x">2197-1781</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal Languages and Automata Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science Logic and Foundations of Programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computability and Recursion Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory and Algorithms for Application Domains</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursion theory</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">978-3-031-11964-4</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">978-3-031-11966-8</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</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-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2022</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033834129</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">FHD01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">FHI01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">FHM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">FHR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">FKE01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">FLA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">FWS01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">FWS02</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">HTW01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">UBA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">UEI01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-031-11965-1</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV048456074 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T20:32:31Z |
| indexdate | 2024-08-01T10:46:59Z |
| institution | BVB |
| isbn | 9783031119651 |
| issn | 2197-1781 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033834129 |
| oclc_num | 1344265557 |
| open_access_boolean | |
| owner | DE-860 DE-19 DE-BY-UBM DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-188 DE-523 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-1050 DE-20 DE-862 DE-BY-FWS DE-92 DE-355 DE-BY-UBR DE-824 DE-384 DE-M347 DE-573 DE-703 DE-706 DE-739 DE-634 |
| owner_facet | DE-860 DE-19 DE-BY-UBM DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-188 DE-523 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-1050 DE-20 DE-862 DE-BY-FWS DE-92 DE-355 DE-BY-UBR DE-824 DE-384 DE-M347 DE-573 DE-703 DE-706 DE-739 DE-634 |
| physical | 1 Online-Ressource (VIII, 280 p. 91 illus) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2022 |
| publishDate | 2022 |
| publishDateSearch | 2022 |
| publishDateSort | 2022 |
| publisher | Springer International Publishing Springer |
| record_format | marc |
| series2 | Undergraduate Topics in Computer Science |
| spellingShingle | Pettorossi, Alberto Automata Theory and Formal Languages Fundamental Notions, Theorems, and Techniques Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Computability and Recursion Theory Theory and Algorithms for Application Domains Machine theory Computer science Computable functions Recursion theory |
| title | Automata Theory and Formal Languages Fundamental Notions, Theorems, and Techniques |
| title_auth | Automata Theory and Formal Languages Fundamental Notions, Theorems, and Techniques |
| title_exact_search | Automata Theory and Formal Languages Fundamental Notions, Theorems, and Techniques |
| title_exact_search_txtP | Automata Theory and Formal Languages Fundamental Notions, Theorems, and Techniques |
| title_full | Automata Theory and Formal Languages Fundamental Notions, Theorems, and Techniques by Alberto Pettorossi |
| title_fullStr | Automata Theory and Formal Languages Fundamental Notions, Theorems, and Techniques by Alberto Pettorossi |
| title_full_unstemmed | Automata Theory and Formal Languages Fundamental Notions, Theorems, and Techniques by Alberto Pettorossi |
| title_short | Automata Theory and Formal Languages |
| title_sort | automata theory and formal languages fundamental notions theorems and techniques |
| title_sub | Fundamental Notions, Theorems, and Techniques |
| topic | Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Computability and Recursion Theory Theory and Algorithms for Application Domains Machine theory Computer science Computable functions Recursion theory |
| topic_facet | Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Computability and Recursion Theory Theory and Algorithms for Application Domains Machine theory Computer science Computable functions Recursion theory |
| url | https://doi.org/10.1007/978-3-031-11965-1 |
| work_keys_str_mv | AT pettorossialberto automatatheoryandformallanguagesfundamentalnotionstheoremsandtechniques |