Request file

Review/Citation:  JIRÁSKOVÁ, G., MASOPUST, Tomáš. On the state and computational complexity of the reverse of acyclic minimal DFAs. In: MOREIRA, N., REIS, R., eds. Implementation and Application of Automata. Berlin: Springer, 2012, s. 229-239. Lecture Notes in Computer Science, 7381. ISBN 978-3-642-31605-0
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.