Determinization of Transducers over Infinite Words
暂无分享,去创建一个
[1] Mehryar Mohri,et al. On some applications of finite-state automata theory to natural language processing , 1996, Nat. Lang. Eng..
[2] Bruce Pruitt Kitchens. Continuity properties of factor maps in ergodic theory , 1981 .
[3] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[4] S. Safra,et al. On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[5] Mark-Jan Nederhof,et al. Efficient generation of random sentences , 1996, Natural Language Engineering.
[6] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.
[7] Christian Choffrut,et al. Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles , 1977, Theor. Comput. Sci..
[8] Ludwig Staiger. Sequential Mappings of omega-Languages , 1987, RAIRO Theor. Informatics Appl..
[9] Albert Cohen,et al. Instance-wise reaching definition analysis for recursive programs using context-free transductions , 1998, Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192).
[10] Emmanuel Roche,et al. Finite-State Language Processing , 1997 .
[11] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .
[12] Françoise Gire. Two Decidability Problems for Infinite Words , 1986, Inf. Process. Lett..
[13] Christophe Prieur,et al. How to decide continuity of rational functions on infinite words , 2001, Theor. Comput. Sci..