Unrestricted State Complexity of Binary Operations on Regular Languages - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Janusz A. Brzozowski. Unrestricted State Complexity of Binary Operations on Regular Languages. In Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, editors, Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings. Volume 9777 of Lecture Notes in Computer Science, pages 60-72, Springer, 2016. [doi]

The following publications are possibly variants of this publication:

Unrestricted State Complexity of Binary Operations on Regular and Ideal LanguagesJanusz A. Brzozowski, Corwin Sinnamon. jalc, 22(1-3):29-59, 2017.

Derivatives of Regular ExpressionsJanusz A. Brzozowski. JACM, 11(4):481-494, 1964. [doi]

runs on WebDSL