On complexity of regular languages in terms of finite automata
By: Piotr Berman, Andrzej Lingas.
Contributors: Lingas, Andrzej.
Series: Prace IPI PAN. ICS PAS reports ;; 304; Prace IPI PAN ;; 304.
Publisher: Institute of Computer Science, Polish Academy of Sciences
Published: 1977
Place of publication: Warsaw
Language: eng
Number of pages: 19
Subjects: Sequential machine theory.; Computational complexity.; Formal languages.
Notes: Bibliography: p. 19.