Author:
Caron Pascal,Champarnaud Jean-Marc,Mignot Ludovic
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. McNaughton, R.F., Yamada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers 9, 39–57 (1960)
2. Glushkov, V.M.: On a synthesis algorithm for abstract automata. Ukr. Matem. Zhurnal 12(2), 147–156 (1960) (in Russian)
3. Brzozowski, J.A., McCluskey, E.J.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Trans. on Electronic Computers EC-12(2) (1963)
4. Hagenah, C., Muscholl, A.: Computing epsilon-free nfa from regular expressions in O(n log
$^{\mbox{2}}$
(n)) time. ITA 34(4), 257–278 (2000)
5. Hromkovic, J., Seibert, S., Wilke, T.: Translating regular expressions into small ε-free nondeterministic finite automata. J. Comput. Syst. Sci. 62(4), 565–588 (2001)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Constrained Multi-Tildes;Implementation and Application of Automata;2023
2. Multi-tilde-bar expressions and their automata;Acta Informatica;2012-09
3. Acyclic automata and small expressions using multi-tilde-bar operators;Theoretical Computer Science;2010-08
4. Simplifying Regular Expressions;Language and Automata Theory and Applications;2010