On the Complexity of k-Piecewise Testability and the Depth of Automata Tom´ aˇs Masopust ? and Micha¨el Thomazo ?? TU Dresden, Germany - Testability - Document - PDFSEARCH.IO

First Page	Meta Content
	On the Complexity of k-Piecewise Testability and the Depth of Automata Tom´ aˇs Masopust ? and Micha¨el Thomazo ?? TU Dresden, Germany Add to Reading List Document Date: 2015-05-15 05:03:52 Open Document File Size: 306,41 KB Share Result on Facebook

On the Complexity of k-Piecewise Testability and the Depth of Automata Tom´ aˇs Masopust ? and Micha¨el Thomazo ?? TU Dresden, Germany Add to Reading List