Automata theory and formal languages: Fundamental notions, theorems, and techniques
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cham
Springer
[2022]
|
Schriftenreihe: | Undergraduate topics in computer science
|
Schlagworte: | |
Beschreibung: | viii, 280 Seiten Illustrationen |
ISBN: | 9783031119644 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV049436794 | ||
003 | DE-604 | ||
005 | 20240202 | ||
007 | t | ||
008 | 231129s2022 a||| |||| 00||| eng d | ||
020 | |a 9783031119644 |9 978-3-031-11964-4 | ||
035 | |a (OCoLC)1343965689 | ||
035 | |a (DE-599)BVBBV049436794 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-11 | ||
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 |d 1947- |e Verfasser |0 (DE-588)1219687251 |4 aut | |
245 | 1 | 0 | |a Automata theory and formal languages |b Fundamental notions, theorems, and techniques |c Alberto Pettorossi |
264 | 1 | |a Cham |b Springer |c [2022] | |
264 | 4 | |c © 2022 | |
300 | |a viii, 280 Seiten |b Illustrationen | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Undergraduate topics in computer science | |
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 Online-Ausgabe |z 978-3-031-11965-1 |
999 | |a oai:aleph.bib-bvb.de:BVB01-034782831 |
Datensatz im Suchindex
_version_ | 1804186184352530432 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Pettorossi, Alberto 1947- |
author_GND | (DE-588)1219687251 |
author_facet | Pettorossi, Alberto 1947- |
author_role | aut |
author_sort | Pettorossi, Alberto 1947- |
author_variant | a p ap |
building | Verbundindex |
bvnumber | BV049436794 |
classification_rvk | ST 136 |
classification_tum | DAT 000 |
ctrlnum | (OCoLC)1343965689 (DE-599)BVBBV049436794 |
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 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01417nam a2200421 c 4500</leader><controlfield tag="001">BV049436794</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240202 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">231129s2022 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783031119644</subfield><subfield code="9">978-3-031-11964-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1343965689</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049436794</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-11</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="d">1947-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1219687251</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">Alberto Pettorossi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</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">viii, 280 Seiten</subfield><subfield code="b">Illustrationen</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Undergraduate topics in computer science</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">Online-Ausgabe</subfield><subfield code="z">978-3-031-11965-1</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034782831</subfield></datafield></record></collection> |
id | DE-604.BV049436794 |
illustrated | Illustrated |
index_date | 2024-07-03T23:11:22Z |
indexdate | 2024-07-10T10:07:05Z |
institution | BVB |
isbn | 9783031119644 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034782831 |
oclc_num | 1343965689 |
open_access_boolean | |
owner | DE-11 |
owner_facet | DE-11 |
physical | viii, 280 Seiten Illustrationen |
publishDate | 2022 |
publishDateSearch | 2022 |
publishDateSort | 2022 |
publisher | Springer |
record_format | marc |
series2 | Undergraduate topics in computer science |
spelling | Pettorossi, Alberto 1947- Verfasser (DE-588)1219687251 aut Automata theory and formal languages Fundamental notions, theorems, and techniques Alberto Pettorossi Cham Springer [2022] © 2022 viii, 280 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Undergraduate topics in computer science 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 Erscheint auch als Online-Ausgabe 978-3-031-11965-1 |
spellingShingle | Pettorossi, Alberto 1947- 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 Alberto Pettorossi |
title_fullStr | Automata theory and formal languages Fundamental notions, theorems, and techniques Alberto Pettorossi |
title_full_unstemmed | Automata theory and formal languages Fundamental notions, theorems, and techniques 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 |
work_keys_str_mv | AT pettorossialberto automatatheoryandformallanguagesfundamentalnotionstheoremsandtechniques |