SCANNING REGULAR LANGUAGES BY DUAL FINITE AUTOMATA

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	WU, PC	en_US
dc.contributor.author	WANG, FJ	en_US
dc.contributor.author	YOUNG, KR	en_US
dc.date.accessioned	2014-12-08T15:04:57Z	-
dc.date.available	2014-12-08T15:04:57Z	-
dc.date.issued	1992-04-01	en_US
dc.identifier.issn	0362-1340	en_US
dc.identifier.uri	http://hdl.handle.net/11536/3478	-
dc.description.abstract	A 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.iso	en_US	en_US
dc.subject	FINITE AUTOMATA	en_US
dc.subject	REGULAR LANGUAGES	en_US
dc.subject	COMPILER	en_US
dc.subject	PARALLEL COMPUTING	en_US
dc.title	SCANNING REGULAR LANGUAGES BY DUAL FINITE AUTOMATA	en_US
dc.type	Article	en_US
dc.identifier.journal	SIGPLAN NOTICES	en_US
dc.citation.volume	27	en_US
dc.citation.issue	4	en_US
dc.citation.spage	12	en_US
dc.citation.epage	16	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
dc.contributor.department	Institute of Computer Science and Engineering	en_US
dc.identifier.wosnumber	WOS:A1992HK55200001	-
dc.citation.woscount	1	-
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。