Descriptional Complexity of Deterministic Regular Expressions

Katja Losemann, Wim Martens, Matthias Niewerth. Descriptional Complexity of Deterministic Regular Expressions. In Branislav Rovan, Vladimiro Sassone, Peter Widmayer, editors, Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings. Volume 7464 of Lecture Notes in Computer Science, pages 643-654, Springer, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.