超尺度有限自动机及其性能

Balt. J. Mod. Comput. Pub Date : 2016-12-19 DOI:10.22364/BJMC.2016.4.4.19

M. Dimitrijevs, Kristine Cipola

{"title":"超尺度有限自动机及其性能","authors":"M. Dimitrijevs, Kristine Cipola","doi":"10.22364/BJMC.2016.4.4.19","DOIUrl":null,"url":null,"abstract":"Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can recognize complex languages and can have small number of states when classical automata require much more states. In this paper, we present a survey on ultrametric automata and their language recognition capabilities.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Ultrametric Finite Automata and Their Capabilities\",\"authors\":\"M. Dimitrijevs, Kristine Cipola\",\"doi\":\"10.22364/BJMC.2016.4.4.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can recognize complex languages and can have small number of states when classical automata require much more states. In this paper, we present a survey on ultrametric automata and their language recognition capabilities.\",\"PeriodicalId\":431209,\"journal\":{\"name\":\"Balt. J. Mod. Comput.\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Balt. J. Mod. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22364/BJMC.2016.4.4.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Balt. J. Mod. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22364/BJMC.2016.4.4.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

超尺度自动机使用p进数来描述计算过程的随机分支。以往的研究表明，超尺度自动机可以识别复杂的语言，并且可以具有少量的状态，而经典自动机需要更多的状态。本文对超尺度自动机及其语言识别能力进行了综述。

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

查看原文本刊更多论文

Ultrametric Finite Automata and Their Capabilities

Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can recognize complex languages and can have small number of states when classical automata require much more states. In this paper, we present a survey on ultrametric automata and their language recognition capabilities.

求助全文

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

来源期刊

Balt. J. Mod. Comput.

自引率

0.00%

发文量