Small Sweeping 2NFAs Are Not Closed Under Complement

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/11786986_14 ◽

2006 ◽

pp. 144-156 ◽

Cited By ~ 9

Author(s):

Christos A. Kapoutsis

Download Full-text