Obtaining Shorter Regular Expressions from Finite-State Automata

Title
Obtaining Shorter Regular Expressions from Finite-State Automata
Authors
한요섭Derick Wood
Keywords
regular languages; state elimination; Finite-state automata; Bridge states; Vertical chopping; Horizontal chopping
Issue Date
2007-02
Publisher
Theoretical computer science
Citation
VOL 370, 110-120
URI
http://pubs.kist.re.kr/handle/201004/31400
ISSN
0304-3975
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