Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
Document Date: 2015-03-19 07:48:14
Open Document
File Size: 479,19 KB
Share Result on Facebook
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