×

Found 4 Documents (Results 1–4)

On the average complexity of Brzozowski’s algorithm for deterministic automata with a small number of final states. (English) Zbl 1425.68193

Shur, Arseny M. (ed.) et al., Developments in language theory. 18th international conference, DLT 2014, Ekaterinburg, Russia, August 26–29, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8633, 25-36 (2014).
MSC:  68Q45 68Q25
PDFBibTeX XMLCite
Full Text: DOI Link

Brzozowski algorithm is generically super-polynomial for deterministic automata. (English) Zbl 1381.68113

Béal, Marie-Pierre (ed.) et al., Developments in language theory. 17th international conference, DLT 2013, Marne-la-Vallée, France, June 18–21, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38770-8/pbk). Lecture Notes in Computer Science 7907, 179-190 (2013).
MSC:  68Q45 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Random generation of deterministic acyclic automata using the recursive method. (English) Zbl 1381.68112

Bulatov, Andrei A. (ed.) et al., Computer science – theory and applications. 8th international computer science symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25–29, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38535-3/pbk). Lecture Notes in Computer Science 7913, 88-99 (2013).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field