NFA reduction algorithms by means of regular inequalities
Theoretical Computer Science - Developments in language theory
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
A Type-Safe Embedding of XDuce into ML
Electronic Notes in Theoretical Computer Science (ENTCS)
NFA reduction algorithms by means of regular inequalities
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Regular expression containment: coinductive axiomatization and computational interpretation
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The inclusion problem for regular expressions
Journal of Computer and System Sciences
Efficient dynamic access analysis using JavaScript proxies
Proceedings of the 9th symposium on Dynamic languages
Hi-index | 0.00 |