On Pebble Automata for Data Languages with Decidable Emptiness Problem Tony Tan Department of Computer Science, Technion – Israel Institute of Technology School of Informatics, University of Edinburgh ni - Tony Tan - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2013-09-27 07:35:34 Computer science Symbol Automata theory Theoretical computer science Pebble automaton		On Pebble Automata for Data Languages with Decidable Emptiness Problem Tony Tan Department of Computer Science, Technion – Israel Institute of Technology School of Informatics, University of Edinburgh ni Add to Reading List Source URL: alpha.uhasselt.be Download Document from Source Website File Size: 228,96 KB Share Document on Facebook

	On Pebble Automata for Data Languages with Decidable Emptiness Problem Tony Tan Department of Computer Science, Technion – Israel Institute of Technology School of Informatics, University of Edinburgh ni DocID: 1gpr4 - View Document
	On Pebble Automata for Data Languages with Decidable Emptiness ProblemI,II Tony Tan School of Informatics, University of Edinburgh Abstract DocID: 1atO7 - View Document
	PDF Document DocID: 1eh2 - View Document