On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
Metadata only
Date
2009Type
- Journal Article
Publication status
publishedExternal links
Journal / series
Theoretical Computer ScienceVolume
Pages / Article No.
Publisher
ElsevierSubject
Communication complexity; Descriptional complexity; Finite automata; NondeterminismNotes
Available online 26 March 2009.More
Show all metadata