Home
Scholarly Works
Obtaining Tight Upper Bounds for the State...
Conference

Obtaining Tight Upper Bounds for the State Complexities of DFA Operations.

Authors

Yu S; Zhuang Q; Salomaa K

Editors

Koczkodaj WW; Lauer PE; Toptsis AA

Pagination

pp. 100-104

Publisher

IEEE Computer Society

Publication Date

January 1, 1992

ISBN-10

0-8186-2812-X

Conference proceedings

ICCI

Contact the Experts team