Author:
Almeida André,Almeida Marco,Alves José,Moreira Nelma,Reis Rogério
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Almeida, M., Moreira, N., Reis, R.: Enumeration and generation with a string automata representation. Theoret. Comput. Sci. 387(2), 93–102 (2007)
2. Lecture Notes in Computer Science;M. Almeida,2008
3. Almeida, M., Moreira, N., Reis, R.: Exact generation of acyclic deterministic finite automata. In: DCFS 2008, Charlottetown, Canada (2008)
4. Almeida, M., Moreira, N., Reis, R.: Exact generation of minimal acyclic deterministic finite automata. I. J. of F. of Com. Sci. 19(4), 751–765 (2008)
5. Barker, C.: Floatcanvas, http://morticia.cs.dal.ca/FloatCanvas/ (access date: 1.12.2008)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mata: A Fast and Simple Finite Automata Library;Lecture Notes in Computer Science;2024
2. Approximate NFA universality and related problems motivated by information theory;Theoretical Computer Science;2023-09
3. Automated Grading of Regular Expressions;Programming Languages and Systems;2023
4. Smaller Representation of Compiled Regular Expressions;Implementation and Application of Automata;2023
5. Gidayu;Proceedings of the 27th ACM Conference on on Innovation and Technology in Computer Science Education Vol. 1;2022-07-07