Titlebook: Automata, Languages and Programming; 22nd International C Zoltán Fül?p,Ferenc Gécseg Conference proceedings 1995 Springer-Verlag Berlin Hei

織布機(jī)

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166216.jpg

大范圍流行

A domain for concurrent termination a generalization of Mazurkiewicz traces,t component and a second alphabetic component yields some information about future actions. This allows to define a good semantic domain where the concatenation is continuous with respect to the Scott- and to the Lawson topology. For this we define the notion of .- and of .-trace. We show various ma

ENNUI

Nonfinite axiomatizability of the equational theory of shuffle,concatenation, shuffle product and union, respectively, and where the constant 0 is the empty set and the constant 1 is the singleton set containing the empty word. We show that the variety . generated by the structures .. has no finite axiomatization.