Als Mentor am Institut für Informatik stelle ich mich als Ansprechpartner, insbesondere den Studierenden in den ersten Semestern, zur Verfügung. Ich habe selber an der LMU Informatik Studiert und meinen Abschluss im Februar 2003 gemacht. Ich weiss aus eigener Erfahrung, dass der Einstieg ins Studium mit neuer, fremder Umgebung, nicht immer einfach ist.
Ich stehe in meiner Mentorensprechstunde (Freitag 14:00-15:00) gerne zur Verfügung, um bei Fragen und Problemen (z.B. zum Stundenplan, zu abzulegenden Scheinen, zur Universitätsbürokratie usw.) zu helfen.
Typing and schema languages based on tree grammars are widely accepted in the XML and Web community. In particular DTD, XML Schema and Relax NG are based on regular tree grammars. The purpose of such formalisms inspired by tree grammars range from documentation, data validation, software development support (eg. by generating code stubs) to type checking of query and transformation languages such as XQuery and XSLT.
Although graph structured XML data — built using reference mechanisms such as ID/IDREF — is widespread, common schema languages have no notion of typed references. In other words, formalisms based on tree grammars do not fully convey the graph structures of XML and semistructured data. Regular graph grammars aim at filling this gap. Regular (rooted) graph grammars are proposed as an extension of regular tree grammars, providing means to explicitly model typed references and dereferencation in XML and semistructured data.
Regular graph grammars are usable as schema formalism for XML and semistructured data containing references and as datatype formalism for typed variants of Xcerpt and XChange.
