Author:
Fahmy Amr F.,Roos Robert S.
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Angluin, D.: Learning regular sets from queries and counter examples. Information and Computation 75 (1987) 87–106
2. Berman, P., Roos, R.: Learning one-counter languages in polynomial time. Proceedings of the 28th IEEE Symposium on Foundations of Computer Science (1987) 61–67
3. Biermann, A.W.: A fundamental theorem for real time programs. Duke Univerity Department of Computer Science technical report (1977)
4. Fahmy, A. F., Biermann, A. W.: Synthesis of real time acceptors. Journal of Symbolic Computation 15 (1993) 807–842
5. Fahmy, A. F.: Synthesis of Real Time Programs. PhD thesis, Duke University, 1989
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning Realtime One-Counter Automata;Tools and Algorithms for the Construction and Analysis of Systems;2022
2. Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete;Mathematical Foundations of Computer Science 2011;2011
3. The Complexity of Finding SUBSEQ(A);Theory of Computing Systems;2008-04-19