Berman, Piotr; Lingas, Andrzej On complexity of regular languages in terms of finite automata. (English) Zbl 0364.68057 Prace Centr. oblicz. Polsk. Akad. Nauk 304. Warsaw: Institute of Computer Science, Polish Academy of Sciences. 20 p. (1977). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 24 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68Q45 Formal languages and automata PDFBibTeX XML