大型NFAs的分布式确定

2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT) Pub Date : 2020-10-07 DOI:10.1109/AICT50176.2020.9368741

Cheikh Ba, A. Gueye

{"title":"大型NFAs的分布式确定","authors":"Cheikh Ba, A. Gueye","doi":"10.1109/AICT50176.2020.9368741","DOIUrl":null,"url":null,"abstract":"Large NFAs are automata that cannot fit in a single computer, or the computations would not fit within the computer RAM, or may take a long time. We describe and implement a distributed solution of such NFAs determinization. Our method drastically reduces required iterations, and avoids producing useless states of the determinized automaton, contrary to some previous implementations of well-known powerset construction. A running example is provided with execution details. Finally, complexity analysis is given. This work will help in bringing out relevant programming artifacts for our long term goal that consists of a high level distributed graph language.","PeriodicalId":136491,"journal":{"name":"2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On The Distributed Determinization Of Large NFAs\",\"authors\":\"Cheikh Ba, A. Gueye\",\"doi\":\"10.1109/AICT50176.2020.9368741\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Large NFAs are automata that cannot fit in a single computer, or the computations would not fit within the computer RAM, or may take a long time. We describe and implement a distributed solution of such NFAs determinization. Our method drastically reduces required iterations, and avoids producing useless states of the determinized automaton, contrary to some previous implementations of well-known powerset construction. A running example is provided with execution details. Finally, complexity analysis is given. This work will help in bringing out relevant programming artifacts for our long term goal that consists of a high level distributed graph language.\",\"PeriodicalId\":136491,\"journal\":{\"name\":\"2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICT50176.2020.9368741\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICT50176.2020.9368741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

大型nfa是无法在单个计算机中适应的自动机，或者计算不适合计算机RAM，或者可能需要很长时间。我们描述并实现了这种NFAs确定的分布式解决方案。我们的方法大大减少了所需的迭代，并避免了产生确定自动机的无用状态，这与之前一些著名的powerset构造的实现相反。提供了一个运行的示例，其中包含执行细节。最后进行了复杂性分析。这项工作将有助于为我们的长期目标(包括高级分布式图形语言)带来相关的编程工件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On The Distributed Determinization Of Large NFAs

Large NFAs are automata that cannot fit in a single computer, or the computations would not fit within the computer RAM, or may take a long time. We describe and implement a distributed solution of such NFAs determinization. Our method drastically reduces required iterations, and avoids producing useless states of the determinized automaton, contrary to some previous implementations of well-known powerset construction. A running example is provided with execution details. Finally, complexity analysis is given. This work will help in bringing out relevant programming artifacts for our long term goal that consists of a high level distributed graph language.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT)

自引率

0.00%

发文量