نتایج جستجو برای: decomposition theorem
تعداد نتایج: 239150 فیلتر نتایج به سال:
2017
Paul Gallot
Anca Muscholl
Gabriele Puppis
Sylvain Salvati
We prove the following decomposition theorem: every 1-register streaming string transducer that associates a uniformly bounded number of outputs with each input can be effectively decomposed as a finite union of functional 1-register streaming string transducers. This theorem relies on a combinatorial result by Kortelainen concerning word equations with iterated factors. Our result implies the ...
Journal:
:Journal of the Mathematical Society of Japan
1997
Journal:
:Discrete & Computational Geometry
1988
Journal:
:Proceedings of the Edinburgh Mathematical Society
2015
Journal:
:Bulletin of the American Mathematical Society
1974
Journal:
:Journal of the Australian Mathematical Society
1971
Journal:
:SIAM Journal on Computing
2001
Journal:
:Journal of the Korean Mathematical Society
2015
Journal:
:International Journal of Approximate Reasoning
2007
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید