First Page | Document Content | |
---|---|---|
![]() Date: 2010-12-22 09:12:53Computer science Model checking Finite-state machine Tree automaton End Model theory Simply typed lambda calculus Graph Configuration graph Theoretical computer science Automata theory Mathematics | Add to Reading List |
![]() | 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 |