Nondeterministic regular expressions as solutions of equational systems
暂无分享,去创建一个
[1] D.J.B. Bosscher,et al. Grammars modulo bisimulation , 1997 .
[2] I. N. Sneddon,et al. Theory Of Automata , 1969 .
[3] Rocco De Nicola,et al. A finite axiomatization of nondeterministic regular expressions , 1999, RAIRO Theor. Informatics Appl..
[4] Rocco De Nicola,et al. Models of Nondeterministic Regular Expressions , 1999, J. Comput. Syst. Sci..
[5] Robin Milner,et al. A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..
[6] Zoltán Ésik,et al. Iteration Theories of Synchronization Trees , 1993, Inf. Comput..