ar X iv : c s . C L / 0 40 60 03 v 1 2 J un 2 00 4 Algorithms for Weighted Multi - Tape Automata – XRCE Research Report 2004 / 031 – Andre Kempe

نویسندگان

  • Andre Kempe
  • Franck Guingne
  • Florent Nicart
چکیده

This report defines various operations and describes algorithms for weighted multi-tape automata (WMTAs). It presents, among others, a new approach to multi-tape intersection, meaning the intersection of a number of tapes of one WMTA with the same number of tapes of another WMTA, which can be seen as a generalization of transducer intersection. In our approach, multi-tape intersection is not considered as an atomic operation but rather as a sequence of more elementary ones. We show an example of multi-tape intersection, actually transducer intersection, that can be compiled with our approach but not with several other methods that we analyzed. Finally we describe an example of practical application, namely the preservation of intermediate results in transduction cascades. Kempe, Guingne, Nicart. Algorithms for n-Tape Automata. XRCE Report 2004 / 031 2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms for weighted multi-tape automata

This report defines various operations and describes algorithms for weighted multi-tape automata (WMTAs). It presents, among others, a new approach to multi-tape intersection, meaning the intersection of a number of tapes of one WMTA with the same number of tapes of another WMTA, which can be seen as a generalization of transducer intersection. In our approach, multi-tape intersection is not co...

متن کامل

ar X iv : c s / 03 10 04 6 v 2 [ cs . C C ] 1 4 Ju n 20 04 Theory of One Tape Linear Time Turing Machines ∗

A theory of one-tape linear-time Turing machines is quite different from its polynomial-time counterpart since one-tape linear-time Turing machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machi...

متن کامل

ar X iv : m at h - ph / 0 40 60 11 v 1 4 J un 2 00 4 PATH INTEGRALS FOR PARASTATISTICS

We demonstrate that parastatistics can be quantized using path integrals by calculating the generating functionals for time-ordered products of both free and interacting parabose and parafermi fields in terms of path integrals.

متن کامل

ar X iv : c s / 01 10 03 8 v 1 [ cs . C C ] 1 8 O ct 2 00 1 Counting Is Easy †

For any fixed k, a remarkably simple single-tape Turing machine can simulate k independent counters in real time.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004