On complexity of regular languages in terms of finite automata:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Warszawa
1977
|
| Schriftenreihe: | Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN
304 |
| Schlagworte: | |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009943890 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941212s1977 |||| 00||| engod | ||
| 035 | |a (OCoLC)19556033 | ||
| 035 | |a (DE-599)BVBBV009943890 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 050 | 0 | |a QA267 | |
| 050 | 0 | |a QA297 | |
| 082 | 0 | |a 510 |2 19 | |
| 082 | 0 | |a 511 |2 19 | |
| 100 | 1 | |a Berman, Piotr |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On complexity of regular languages in terms of finite automata |
| 264 | 1 | |a Warszawa |c 1977 | |
| 300 | |a 19 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN |v 304 | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Sequential machine theory | |
| 700 | 1 | |a Lingas, Andrzej |e Verfasser |4 aut | |
| 830 | 0 | |a Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN |v 304 |w (DE-604)BV005632354 |9 304 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006588850 | ||
Datensatz im Suchindex
| _version_ | 1804124313078464512 |
|---|---|
| any_adam_object | |
| author | Berman, Piotr Lingas, Andrzej |
| author_facet | Berman, Piotr Lingas, Andrzej |
| author_role | aut aut |
| author_sort | Berman, Piotr |
| author_variant | p b pb a l al |
| building | Verbundindex |
| bvnumber | BV009943890 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 QA297 |
| callnumber-search | QA267 QA297 |
| callnumber-sort | QA 3267 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)19556033 (DE-599)BVBBV009943890 |
| dewey-full | 510 511 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics 511 - General principles of mathematics |
| dewey-raw | 510 511 |
| dewey-search | 510 511 |
| dewey-sort | 3510 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01071nam a2200361 cb4500</leader><controlfield tag="001">BV009943890</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941212s1977 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)19556033</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009943890</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA297</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield><subfield code="2">19</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511</subfield><subfield code="2">19</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Berman, Piotr</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On complexity of regular languages in terms of finite automata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Warszawa</subfield><subfield code="c">1977</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 S.</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="1" ind2=" "><subfield code="a">Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN</subfield><subfield code="v">304</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequential machine theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lingas, Andrzej</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN</subfield><subfield code="v">304</subfield><subfield code="w">(DE-604)BV005632354</subfield><subfield code="9">304</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006588850</subfield></datafield></record></collection> |
| id | DE-604.BV009943890 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:43:40Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006588850 |
| oclc_num | 19556033 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 19 S. |
| publishDate | 1977 |
| publishDateSearch | 1977 |
| publishDateSort | 1977 |
| record_format | marc |
| series | Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN |
| series2 | Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN |
| spelling | Berman, Piotr Verfasser aut On complexity of regular languages in terms of finite automata Warszawa 1977 19 S. txt rdacontent n rdamedia nc rdacarrier Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN 304 Computational complexity Formal languages Sequential machine theory Lingas, Andrzej Verfasser aut Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN 304 (DE-604)BV005632354 304 |
| spellingShingle | Berman, Piotr Lingas, Andrzej On complexity of regular languages in terms of finite automata Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN Computational complexity Formal languages Sequential machine theory |
| title | On complexity of regular languages in terms of finite automata |
| title_auth | On complexity of regular languages in terms of finite automata |
| title_exact_search | On complexity of regular languages in terms of finite automata |
| title_full | On complexity of regular languages in terms of finite automata |
| title_fullStr | On complexity of regular languages in terms of finite automata |
| title_full_unstemmed | On complexity of regular languages in terms of finite automata |
| title_short | On complexity of regular languages in terms of finite automata |
| title_sort | on complexity of regular languages in terms of finite automata |
| topic | Computational complexity Formal languages Sequential machine theory |
| topic_facet | Computational complexity Formal languages Sequential machine theory |
| volume_link | (DE-604)BV005632354 |
| work_keys_str_mv | AT bermanpiotr oncomplexityofregularlanguagesintermsoffiniteautomata AT lingasandrzej oncomplexityofregularlanguagesintermsoffiniteautomata |