🚀 go-pugleaf

Theoretical Computer Science $B$N(B Editor in chief $B$G$"$k(B Maurice Nivat $B65(B
$B<x$,Mh$?$k(B 12/11($B6b!K$K(B ICOT $B$rK,Ld$5$l$^$9!#(B
$B$3$l$r5!2q$K!"2<5-$NMWNN$G9V(B$B1i2q$r3+:ECW$7$^$9$N$G!"J3$C$F$4;22C2<$5$j$^$9(B
$B$h$&$*4j$$CW$7$^$9!#(B

$B;a$O0JA0$O(B INRIA $B$K$$$i$7$F!"(BICOT $B$H(B INRIA $B$NF|J)%o!<%/%7%g%C%W$N;~$N(B
INRIA $BB&$NBeI=$rL3$a$i$l$?J}$G$b$"$j$^$9!#(B


                               $B5-(B

$BF|;~!'(B12$B7n(B11$BF|(B($B6b(B)   11:00-12:00
$B>l=j!'El5~ET9A6h;0ED#1(B-4-28 $B;0ED9q:]%S%k(B 21F 
       ($B:b(B)$B?7@$Be%3%s%T%e!<%?5;=Q3+H/5!9=(B  $BLr0w2q5D<<(B
      TEL : 03-3456-4365
$B9V1iBjL\!'!X(BUltimately periodic behaviors of systems$B!Y(B
$B9V1iMW;]!'(B
  Omega regular sets of words are characterized by the subsets of their
  ultimately periodic or UP words.
  We characterize the sets of UP words which are equal to UP(M) for some
  omega regular M: the set L is such a set iff the set of words u$v
  where uvpower omega belongs to l is regular(as an ordinary set of
  finite words).
  We then attempt to use thes sets L$ of finite words to solve problems
  about the Buchi automata recognizing the omega languages.

-----
$BGr0f9/G7(B(shirai@icot.or.jp)
       ($B:b(B)$B?7@$Be%3%s%T%e!<%?5;=Q3+H/5!9=(B
        TEL : 03-3456-4365  FAX : 03-3456-1618




--
-----
$BGr0f9/G7(B(shirai@icot.or.jp)
       ($B:b(B)$B?7@$Be%3%s%T%e!<%?5;=Q3+H/5!(B$B9=(B
        TEL : 03-3456-4365  FAX : 03-3456-1618