Full metadata record
DC FieldValueLanguage
dc.contributor.authorWU, PCen_US
dc.contributor.authorWANG, FJen_US
dc.contributor.authorYOUNG, KRen_US
dc.date.accessioned2014-12-08T15:04:57Z-
dc.date.available2014-12-08T15:04:57Z-
dc.date.issued1992-04-01en_US
dc.identifier.issn0362-1340en_US
dc.identifier.urihttp://hdl.handle.net/11536/3478-
dc.description.abstractA regular language is generally accepted by a single finite automaton. An approach of dual finite automata is presented here. An input string is scanned by two deterministic finite automata (DFA's): reading from the string's head and tail respectively. One of them accepts the regular language itself; the other accepts the language's reversal. Whether a string is accepted depends on the states of both automata, when their reading heads meet. Dual finite automata can be applied in compiler generation and parallel computing.en_US
dc.language.isoen_USen_US
dc.subjectFINITE AUTOMATAen_US
dc.subjectREGULAR LANGUAGESen_US
dc.subjectCOMPILERen_US
dc.subjectPARALLEL COMPUTINGen_US
dc.titleSCANNING REGULAR LANGUAGES BY DUAL FINITE AUTOMATAen_US
dc.typeArticleen_US
dc.identifier.journalSIGPLAN NOTICESen_US
dc.citation.volume27en_US
dc.citation.issue4en_US
dc.citation.spage12en_US
dc.citation.epage16en_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:A1992HK55200001-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. A1992HK55200001.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.