h1

h2

h3

h4

h5
h6
http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

The Complexity of Finding Reset Words in Finite Automata

;

In
Mathematical 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.), Seiten/Artikel-Nr: 568-579

Konferenz/Event:35. international symposium: Mathematical foundations of computer science 2010 , Brno , Czech Republic , MFCS 2010 , 2010-08-23 - 2010-08-27

ImpressumBerlin [u.a.] : Springer

Umfang568-579

ISBN3-642-15154-X, 978-3-642-15154-5, 978-3-642-15155-2

ReiheLecture notes in computer science ; 6281

Online
URL: http://www.logic.rwth-aachen.de/~ummels/mfcs10.pdf

Einrichtungen

  1. Fachgruppe Mathematik (110000)
  2. Lehr- und Forschungsgebiet Mathematische Grundlagen der Informatik (Logik und Komplexität) (117220)


External link:
Download fulltext
Fulltext

Dokumenttyp
Contribution to a conference proceedings/Contribution to a book

Format
online, print

Sprache
English

Anmerkung
Peer reviewed article

Externe Identnummern
WOS Core Collection: WOS:000285031800050

Interne Identnummern
RWTH-CONV-190993
Datensatz-ID: 119910

Beteiligte Länder
France, Germany

 GO

QR Code for this record

The record appears in these collections:
Document types > Events > Contributions to a conference proceedings
Document types > Books > Contributions to a book
Faculty of Mathematics and Natural Sciences (Fac.1) > Department of Mathematics
Public records
Publications database
110000
117220
 Record created 2013-01-28, last modified 2022-11-03
Similar records


External link:
Download fulltext
Fulltext
Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)