Minimizing finite automata is computationally hard:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Frankfurt am Main
Inst. für Informatik
2002
|
| Schriftenreihe: | Frankfurter Informatik-Berichte
2002,6 |
| Beschreibung: | IV, 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV025354643 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 100417s2002 |||| 00||| eng d | ||
| 035 | |a (OCoLC)614601077 | ||
| 035 | |a (DE-599)BVBBV025354643 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 | ||
| 100 | 1 | |a Malcher, Andreas |d 1971- |e Verfasser |0 (DE-588)123773245 |4 aut | |
| 245 | 1 | 0 | |a Minimizing finite automata is computationally hard |c Andreas Malcher |
| 264 | 1 | |a Frankfurt am Main |b Inst. für Informatik |c 2002 | |
| 300 | |a IV, 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Frankfurter Informatik-Berichte |v 2002,6 | |
| 830 | 0 | |a Frankfurter Informatik-Berichte |v 2002,6 |w (DE-604)BV014078586 |9 2002,6 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-019981804 | ||
Datensatz im Suchindex
| _version_ | 1804142435375251456 |
|---|---|
| any_adam_object | |
| author | Malcher, Andreas 1971- |
| author_GND | (DE-588)123773245 |
| author_facet | Malcher, Andreas 1971- |
| author_role | aut |
| author_sort | Malcher, Andreas 1971- |
| author_variant | a m am |
| building | Verbundindex |
| bvnumber | BV025354643 |
| ctrlnum | (OCoLC)614601077 (DE-599)BVBBV025354643 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00847nam a2200265 cb4500</leader><controlfield tag="001">BV025354643</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100417s2002 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)614601077</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV025354643</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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="100" ind1="1" ind2=" "><subfield code="a">Malcher, Andreas</subfield><subfield code="d">1971-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123773245</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Minimizing finite automata is computationally hard</subfield><subfield code="c">Andreas Malcher</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Frankfurt am Main</subfield><subfield code="b">Inst. für Informatik</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IV, 16 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">Frankfurter Informatik-Berichte</subfield><subfield code="v">2002,6</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Frankfurter Informatik-Berichte</subfield><subfield code="v">2002,6</subfield><subfield code="w">(DE-604)BV014078586</subfield><subfield code="9">2002,6</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-019981804</subfield></datafield></record></collection> |
| id | DE-604.BV025354643 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T22:31:43Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-019981804 |
| oclc_num | 614601077 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | IV, 16 S. |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Inst. für Informatik |
| record_format | marc |
| series | Frankfurter Informatik-Berichte |
| series2 | Frankfurter Informatik-Berichte |
| spelling | Malcher, Andreas 1971- Verfasser (DE-588)123773245 aut Minimizing finite automata is computationally hard Andreas Malcher Frankfurt am Main Inst. für Informatik 2002 IV, 16 S. txt rdacontent n rdamedia nc rdacarrier Frankfurter Informatik-Berichte 2002,6 Frankfurter Informatik-Berichte 2002,6 (DE-604)BV014078586 2002,6 |
| spellingShingle | Malcher, Andreas 1971- Minimizing finite automata is computationally hard Frankfurter Informatik-Berichte |
| title | Minimizing finite automata is computationally hard |
| title_auth | Minimizing finite automata is computationally hard |
| title_exact_search | Minimizing finite automata is computationally hard |
| title_full | Minimizing finite automata is computationally hard Andreas Malcher |
| title_fullStr | Minimizing finite automata is computationally hard Andreas Malcher |
| title_full_unstemmed | Minimizing finite automata is computationally hard Andreas Malcher |
| title_short | Minimizing finite automata is computationally hard |
| title_sort | minimizing finite automata is computationally hard |
| volume_link | (DE-604)BV014078586 |
| work_keys_str_mv | AT malcherandreas minimizingfiniteautomataiscomputationallyhard |