Unrestricted State Complexity of Binary Operations on Regular Languages

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.