签证:获得自动机理论和形式语言的学生绿卡

African Conference on Software Engineering Pub Date : 1998-07-08 DOI:10.1145/289393.289405

M. Holzer, Muriel Quenzer

{"title":"签证:获得自动机理论和形式语言的学生绿卡","authors":"M. Holzer, Muriel Quenzer","doi":"10.1145/289393.289405","DOIUrl":null,"url":null,"abstract":"We describe the software pa&age VISA (Visualized Automata and Formal Languages) -which will be part of an Internet tutorial for an undergraduate course on automata and formal language theory. Compared to already existingtools in this area, -whichonly exqhin automata ad their functioning, VISA is also able to visualize constructions step-by-step, e.g., the conversion of nondeterministic iinite automata into deterministkones, the conversion of finite automata into regular expressionsand ~ice uem~","PeriodicalId":435916,"journal":{"name":"African Conference on Software Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"VisA: towards a students' green card to automata theory and formal languages\",\"authors\":\"M. Holzer, Muriel Quenzer\",\"doi\":\"10.1145/289393.289405\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe the software pa&age VISA (Visualized Automata and Formal Languages) -which will be part of an Internet tutorial for an undergraduate course on automata and formal language theory. Compared to already existingtools in this area, -whichonly exqhin automata ad their functioning, VISA is also able to visualize constructions step-by-step, e.g., the conversion of nondeterministic iinite automata into deterministkones, the conversion of finite automata into regular expressionsand ~ice uem~\",\"PeriodicalId\":435916,\"journal\":{\"name\":\"African Conference on Software Engineering\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"African Conference on Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/289393.289405\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"African Conference on Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/289393.289405","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们描述了软件页面VISA(可视化自动机和形式语言)，这将是自动机和形式语言理论本科课程的网络教程的一部分。与该领域现有的工具相比，VISA还能够逐步可视化结构，例如，将不确定性有限自动机转换为确定性自动机，将有限自动机转换为正则表达式和正则表达式

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

查看原文本刊更多论文

VisA: towards a students' green card to automata theory and formal languages

We describe the software pa&age VISA (Visualized Automata and Formal Languages) -which will be part of an Internet tutorial for an undergraduate course on automata and formal language theory. Compared to already existingtools in this area, -whichonly exqhin automata ad their functioning, VISA is also able to visualize constructions step-by-step, e.g., the conversion of nondeterministic iinite automata into deterministkones, the conversion of finite automata into regular expressionsand ~ice uem~

求助全文

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

来源期刊

African Conference on Software Engineering

自引率

0.00%

发文量