Request file

Review/Citation:  CZERWIŃSKI, W., MARTENS, W., MASOPUST, Tomáš. Efficient separability of regular languages by subsequences and suffixes. In: FOMIN, F.V., FREIVALDS, R., KWIATKOWSKA, M., PELEG, D., eds. Automata, Languages, and Programming. Part II. Berlin: Springer, 2013, s. 150-161. Lecture Notes in Computer Science, 7966. ISBN 978-3-642-39211-5
Requested document:  Masopust.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.