State Complexity of Basic Operations on Suffix-Free Regular Languages

Title
State Complexity of Basic Operations on Suffix-Free Regular Languages
Authors
한요섭Kai Salomaa
Keywords
suffix-freeness; regular languages; state complexity
Issue Date
2007-09
Publisher
Lecture notes in computer science
Citation
VOL 4708, 501-512
URI
http://pubs.kist.re.kr/handle/201004/31496
ISSN
0302-9743
Appears in Collections:
KIST Publication > Article
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE