From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity

Hermann Gruber, Markus Holzer 0001. From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity. Int. J. Found. Comput. Sci., 26(8):1009-1040, 2015. [doi]

Authors

Hermann Gruber

This author has not been identified. Look up 'Hermann Gruber' in Google

Markus Holzer 0001

This author has not been identified. Look up 'Markus Holzer 0001' in Google