Sawa, Zdeněk Efficient construction of semilinear representations of languages accepted by unary nondeterministic finite automata. (English) Zbl 1281.68146 Fundam. Inform. 123, No. 1, 97-106 (2013). MSC: 68Q45 PDF BibTeX XML Cite \textit{Z. Sawa}, Fundam. Inform. 123, No. 1, 97--106 (2013; Zbl 1281.68146) Full Text: DOI
Sawa, Zdeněk Efficient construction of semilinear representations of languages accepted by unary NFA. (English) Zbl 1287.68100 Kučera, Antonín (ed.) et al., Reachability problems. 4th international workshop, RP 2010, Brno, Czech Republic, August 28–29, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15348-8/pbk). Lecture Notes in Computer Science 6227, 176-182 (2010). MSC: 68Q45 68Q25 PDF BibTeX XML Cite \textit{Z. Sawa}, Lect. Notes Comput. Sci. 6227, 176--182 (2010; Zbl 1287.68100) Full Text: DOI
Sawa, Zdeněk Equivalence checking of non-flat systems is EXPTIME-hard. (English) Zbl 1274.68134 Amadio, Roberto (ed.) et al., CONCUR 2003 – concurrency theory. 14th international conference, Marseille, France, September 3–5, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40753-7/pbk). Lect. Notes Comput. Sci. 2761, 237-250 (2003). MSC: 68Q17 68Q45 68Q60 68Q85 PDF BibTeX XML Cite \textit{Z. Sawa}, Lect. Notes Comput. Sci. 2761, 237--250 (2003; Zbl 1274.68134) Full Text: DOI