Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages

Yo-Sub Han, Kai Salomaa, Derick Wood. Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. Fundamenta Informaticae, 90(1-2):93-106, 2009. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.