Towards Diagrammability and Efficiency in Event Sequence Languages Kathi Fisler Department of Computer Science WPI (Worcester, MA, USA)

First Page		Document Content
Date: 2005-05-29 14:49:51 Finite automata Theoretical computer science Formal languages Infographics Linear temporal logic Temporal logic Finite-state machine Diagram Sequence Formal verification Automata theory Bchi automaton		Towards Diagrammability and Efficiency in Event Sequence Languages Kathi Fisler Department of Computer Science WPI (Worcester, MA, USA) Add to Reading List Source URL: web.cs.wpi.edu Download Document from Source Website File Size: 168,00 KB Share Document on Facebook

	Finite Horizon Analysis of Markov Automata Dissertation zur Erlangung des akademischen Grades des Doktors der Ingenieurwissenschaften (Dr.-Ing.) der Fakultät für Mathematik und Informatik der Universität des Saarlande DocID: 1xV8b - View Document
	Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica DocID: 1vnjH - View Document
	Math. Appl), 105–122 DOI: maTWO-DIMENSIONAL JUMPING FINITE AUTOMATA S. JAMES IMMANUEL and D. G. THOMAS Abstract. In this paper, we extend a newly introduced concept called the jumping DocID: 1uXmk - View Document
	Simulating Unary Context-Free Grammars and Pushdown Automata with Finite Automata Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano ITALY DocID: 1uOCl - View Document
	Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica DocID: 1uNif - View Document