On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's - Research Collection

Metadata only

Author

Hromkovič, Juraj

Petersen, Holger

Schnitger, Georg

Date

2009

Type

Journal Article

Citations

Cited 2 times in Web of Science

ETH Bibliography

yes

Altmetrics

Publication status

published

External links

https://doi.org/10.1016/j.tcs.2009.03.020

Journal / series

Theoretical Computer Science

Volume

410(30-32)

Pages / Article No.

2972 - 2981

Publisher

Elsevier

Subject

Communication complexity; Descriptional complexity; Finite automata; Nondeterminism

Notes

Available online 26 March 2009.

More

Show all metadata

Citations

Cited 2 times in Web of Science

ETH Bibliography

yes

Altmetrics