DocumentCode
2200351
Title
Complexity and structure in formal language theory
Author
Lange, Klaus-Jörn
Author_Institution
Fakultat fuer Inf., Tech. Univ. Munchen, Germany
fYear
1993
fDate
18-21 May 1993
Firstpage
224
Lastpage
238
Abstract
Some connections between formal languages and complexity are reviewed. Families of formal languages are treated with complexity theoretical methods. In particular, the concept of unambiguity, common to both areas, is treated in detail. Some new results on deterministic families of formal languages and on complexities of operations on formal languages are indicated
Keywords
computational complexity; formal languages; complexity; deterministic families; formal language theory; unambiguity; Automata; Complexity theory; Eyes; Formal languages; Microwave integrated circuits; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Structure in Complexity Theory Conference, 1993., Proceedings of the Eighth Annual
Conference_Location
San Diego, CA
Print_ISBN
0-8186-4070-7
Type
conf
DOI
10.1109/SCT.1993.336523
Filename
336523
Link To Document