Author:
Caron Pascal,Ziadi Djelloul
Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. From regular expression to deterministic automata;Berry;Theoret. Comput. Sci.,1986
3. J. Berstel, Transductions and Context-free Languages, Teubner, Stuttgart, 1979.
4. J. Berstel, Finite automata and rational languages, an introduction, in: J.-E. Pin (Ed.), Formal Properties of Finite Automata and Applications, Lecture Notes in Computer Science, vol. 386, Springer-Verlag, Berlin, 1989, pp. 2–14.
5. Local languages and the Berry–Sethi algorithm;Berstel;Theoret. Comput. Sci.,1996
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Constrained Multi-Tildes;Implementation and Application of Automata;2023
2. Smaller Representation of Compiled Regular Expressions;Implementation and Application of Automata;2023
3. How to Settle the ReDoS Problem: Back to the Classical Automata Theory;Implementation and Application of Automata;2022
4. In-/Near-Memory Computing;Synthesis Lectures on Computer Architecture;2021-08-11
5. Left is Better Than Right for Reducing Nondeterminism of NFAs;International Journal of Foundations of Computer Science;2021-04-23