REGULAR TREE LANGUAGE RECOGNITION WITH STATIC INFORMATION Alain Frisch École Normale Supérieure

First Page		Document Content
Date: 2013-12-06 16:18:26 Tree automaton Pushdown automaton Symbol Finite-state machine Automata theory Theoretical computer science Computer science		REGULAR TREE LANGUAGE RECOGNITION WITH STATIC INFORMATION Alain Frisch École Normale Supérieure Add to Reading List Source URL: www.cduce.org Download Document from Source Website File Size: 116,53 KB Share 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–2016 DocID: 1oS7V - View Document
	Average Analysis of Glushkov Automata under a BST-Like Model Cyril Nicaud1 , Carine Pivoteau1 , and Benoît Razet2 1 2 DocID: 1nGg0 - View Document
	JFP): 218–283, c Cambridge University Press 2014 ⃝ 218 DocID: 1lF8p - View Document
	PDF Document DocID: 1iNRf - View Document