{"title":"Possible edges of a finite automaton defining a given regular language","authors":"B. Melnikov, N. Sciarini-Guryanova","doi":"10.1007/BF03021555","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":389505,"journal":{"name":"Korean Journal of Computational & Applied Mathematics","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Korean Journal of Computational & Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BF03021555","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}