Unbounded Model-Checking with Interpolation for Regular Language Constraints Graeme Gange, Jorge A. Navas, Peter J. Stuckey, Harald Søndergaard, and Peter Schachte The University of Melbourne {ggange,jnavas,pjs,harald,s

First Page		Document Content
Date: 2018-10-25 12:43:22 Finite automata DFA minimization Deterministic automaton Finite-state machine Theoretical computer science Muller automaton Bchi automaton		Unbounded Model-Checking with Interpolation for Regular Language Constraints Graeme Gange, Jorge A. Navas, Peter J. Stuckey, Harald Søndergaard, and Peter Schachte The University of Melbourne {ggange,jnavas,pjs,harald,s Add to Reading List Source URL: jorgenavas.github.io Download Document from Source Website File Size: 381,64 KB Share Document on Facebook

	On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing DocID: 1rggm - View Document
	Session F2C NON-DETERMINISM IN CS HIGH-SCHOOL CURRICULA Michal Armoni 1 and Judith Gal-Ezer 2 Abstract - One of the units in the relatively new high school CS curriculum which is being implemented in Israel is a DocID: 1qIve - View Document
	An Ant Colony Verification Algorithm Rachid Rebiha Giovanni L. Ciampaglia Universit`a della Svizzera Italiana, Faculty of Informatics. {rachid.rebiha, ciampagg}@lu.unisi.ch Abstract DocID: 1p0Gc - View Document
	Towards Diagrammability and Efficiency in Event Sequence Languages Kathi Fisler Department of Computer Science WPI (Worcester, MA, USA) DocID: 1oEB9 - View Document
	The validity of weighted automata (Fragments) Sylvain Lombardy LABRI, Universit´e de Bordeaux Jacques Sakarovitch DocID: 1kg8R - View Document