h1

h2

h3

h4

h5
h6
000119910 001__ 119910
000119910 005__ 20221103083753.0
000119910 0247_ $$2ISSN$$a0302-9743
000119910 0247_ $$2ISSN$$a1611-3349
000119910 0247_ $$2WOS$$aWOS:000285031800050
000119910 0247_ $$2HSB$$a999910031831
000119910 0247_ $$2ISBN$$a3-642-15154-X
000119910 0247_ $$2ISBN$$a978-3-642-15154-5
000119910 0247_ $$2ISBN$$a978-3-642-15155-2
000119910 037__ $$aRWTH-CONV-190993
000119910 041__ $$aEnglish
000119910 1001_ $$0P:(DE-82)034240$$aOlschewski, Jörg$$b0$$eAuthor
000119910 1112_ $$a35. international symposium: Mathematical foundations of computer science 2010$$cBrno$$d2010-08-23 - 2010-08-27$$gMFCS 2010$$wCzech Republic
000119910 245__ $$aThe Complexity of Finding Reset Words in Finite Automata$$honline, print
000119910 260__ $$aBerlin [u.a.]$$bSpringer$$c2010
000119910 29510 $$aMathematical foundations of computer science 2010 : 35th international symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010 ; proceedings / Petr Hliněný; Antonín Kučera (eds.)
000119910 300__ $$a568-579
000119910 3367_ $$0PUB:(DE-HGF)8$$2PUB:(DE-HGF)$$aContribution to a conference proceedings$$bcontrib$$mcontrib
000119910 3367_ $$033$$2EndNote$$aConference Paper
000119910 3367_ $$2ORCID$$aCONFERENCE_PAPER
000119910 3367_ $$2DataCite$$aOutput Types/Conference Paper
000119910 3367_ $$2DRIVER$$aconferenceObject
000119910 3367_ $$2BibTeX$$aINPROCEEDINGS
000119910 3367_ $$0PUB:(DE-HGF)7$$2PUB:(DE-HGF)$$aContribution to a book
000119910 4900_ $$aLecture notes in computer science$$v6281
000119910 591__ $$aFrance
000119910 591__ $$aGermany
000119910 7001_ $$0P:(DE-82)017696$$aUmmels, Michael$$b1$$eAuthor
000119910 8564_ $$uhttp://www.logic.rwth-aachen.de/~ummels/mfcs10.pdf$$yFulltext
000119910 909CO $$ooai:publications.rwth-aachen.de:119910$$pVDB
000119910 9151_ $$0StatID:(DE-HGF)0031$$2StatID$$aPeer reviewed article
000119910 9201_ $$0I:(DE-82)110000_20140620$$k110000$$lFachgruppe Mathematik$$x0
000119910 9201_ $$0I:(DE-82)117220_20140620$$k117220$$lLehr- und Forschungsgebiet Mathematische Grundlagen der Informatik (Logik und Komplexität)$$x1
000119910 961__ $$c2014-12-23$$x2011-02-18$$z2012-02-20
000119910 970__ $$ahsb999910031831
000119910 980__ $$acontrib
000119910 980__ $$aI:(DE-82)110000_20140620
000119910 980__ $$aI:(DE-82)117220_20140620
000119910 980__ $$aVDB
000119910 980__ $$aUNRESTRICTED
000119910 980__ $$aConvertedRecord
000119910 980__ $$acontb