Separability by Short Subsequences and Subwords Piotr Hofman and Wim Martens Department of Computer Science, University of Bayreuth, Germany Abstract The separability problem for regular languages asks, given two regular

First Page		Document Content
Date: 2015-03-19 07:48:14		Separability by Short Subsequences and Subwords Piotr Hofman and Wim Martens Department of Computer Science, University of Bayreuth, Germany Abstract The separability problem for regular languages asks, given two regular Add to Reading List Source URL: drops.dagstuhl.de Download Document from Source Website File Size: 479,19 KB Share Document on Facebook