First Page | Document Content | |
---|---|---|
Date: 2008-09-29 06:47:38Applied mathematics Tree automaton Finite-state machine Alternating finite automaton Powerset construction Formal language Muller automaton Automata theory Theoretical computer science Computer science | Universit¨at des Saarlandes Naturwissenschaftlich-Technische Fakult¨at 1 Fachrichtung Informatik Bachelor-Studiengang Informatik Bachelor’s ThesisAdd to Reading ListSource URL: cgi.csc.liv.ac.ukDownload Document from Source WebsiteFile Size: 272,18 KBShare Document on Facebook |
24. Theorietag „Automaten und Formale Sprachen“ Caputh, 23. – 25. September 2014 Henning Bordihn, Bianca Truthe (Hrsg.)DocID: 1rsDZ - View Document | |
Foundations of XML Types: Tree Automata Pierre Genevès CNRS (slides mostly based on slides by W. Martens and T. Schwentick) University of Grenoble Alpes, 2015–2016DocID: 1oS7V - View Document | |
Average Analysis of Glushkov Automata under a BST-Like Model Cyril Nicaud1 , Carine Pivoteau1 , and Benoît Razet2 1 2DocID: 1nGg0 - View Document | |
JFP): 218–283, c Cambridge University Press 2014 ⃝ 218DocID: 1lF8p - View Document | |
PDF DocumentDocID: 1iNRf - View Document |