An Automata Model for Trees with Ordered Data Values Tony Tan University of Edinburgh Edinburgh, UK Email:

First Page		Document Content
Date: 2013-09-27 07:35:34 Mathematical logic Theoretical computer science Tree automaton Tree Linear temporal logic First-order logic Finite-state machine Context-free grammar T-tree Automata theory Mathematics Formal languages		An Automata Model for Trees with Ordered Data Values Tony Tan University of Edinburgh Edinburgh, UK Email: Add to Reading List Source URL: alpha.uhasselt.be Download Document from Source Website File Size: 173,23 KB Share Document on Facebook

	On the Visualization of Context-Free Grammar Ike Antkare International Institute of Technology United Slates of Earth DocID: 1srZB - View Document
	American Control Conference, JuneThe Motion Grammar Calculus for Context-Free Hybrid Systems Neil Dantam Mike Stilman DocID: 1s0XJ - View Document
	Synthesizing Context-Free Grammar Using Probabilistic Epistemologies Ike Antkare International Institute of Technology United Slates of Earth DocID: 1s0Vh - View Document
	24. Theorietag „Automaten und Formale Sprachen“ Caputh, 23. – 25. September 2014 Henning Bordihn, Bianca Truthe (Hrsg.) DocID: 1rsDZ - View Document
	m-multiple context-free grammars The Pumping Lemma for Well-Nested Multiple Context-Free Languages DocID: 1rqE5 - View Document