[英]What is a “tagged DFA”?
I came across a regular expression library http://laurikari.net/tre/ and also http://hackage.haskell.org/package/regex-tdfa , but I could not find anything about this "tagged DFA" approach that they are using: neither on the pages of these libraries, nor in google (incl.scholar). 我遇到了一个正则表达式库http://laurikari.net/tre/以及http://hackage.haskell.org/package/regex-tdfa ,但是我找不到任何有关这种“标记DFA”方法的信息。正在使用:既不在这些库的页面上,也不在谷歌(incl.scholar)。
Anyone know what it is about? 有谁知道它是什么?
Here is a paper: 这是一篇论文:
NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions (2000) [PDF] , written by Ville Laurikari. 具有标记转换的NFA,它们转向确定性自动机以及应用于正则表达式(2000)[PDF] ,由Ville Laurikari编写。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.