Author:
Lodaya Kamal,Mukund Madhavan,Phawade Ramchandra
Publisher
Springer Berlin Heidelberg
Reference36 articles.
1. Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155, 291–319 (1996)
2. Arnold, A.: Finite transition systems. Prentice-Hall, Englewood Cliffs (1994)
3. Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoret. Comp. Sci. 48(3), 117–126 (1986)
4. Lecture Notes in Computer Science;E. Best,1983
5. Best, E., Voss, K.: Free choice systems have home states. Acta Inform. 21, 89–100 (1984)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Derivatives and partial derivatives for regular shuffle expressions;Journal of Computer and System Sciences;2019-09
2. Kleene Theorems for Free Choice Automata over Distributed Alphabets;Transactions on Petri Nets and Other Models of Concurrency XIV;2019
3. Derivatives for Regular Shuffle Expressions;Language and Automata Theory and Applications;2015
4. Kleene Theorems for Synchronous Products with Matching;Transactions on Petri Nets and Other Models of Concurrency X;2015