Subject
General Computer Science,Theoretical Computer Science
Reference65 articles.
1. Rational omega-languages are non-ambiguous;Arnold;Theoret. Comput. Sci.,1983
2. A. Arnold, Topological characterizations of infinite behaviours of transition systems, in: J. Diaz (Ed.), Proc. ICALP, Barcelona, Spain, L.N.C.S. Volume 154, pp. 28–38.
3. Context Free Languages and Pushdown Automata;Autebert,1996
4. D. Beauquier, Langages Algébriques Infinitaires, Ph.D. Thesis, Université Paris 7, 1984.
5. D. Beauquier, Some results about finite and infinite behaviours of a pushdown automaton, Proc. 11th Internat. Colloq. on Automata, Languages and Programming (ICALP 84), Antwerp, Belgium, Lecture Notes in Computer Science, vol. 172, Springer, Berlin, 1984, pp. 187–195.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献