Transfinite Equations in Transfinite Strings
نویسندگان
چکیده
منابع مشابه
Periodicity and roots of transfinite strings
This contribution extends the notions of roots and periodicity to strings of transfinite lengths. It shows that given a transfinite string, either it possesses a unique root or the set of its roots are equivalent in a strong way. Mathematics Subject Classification. 68R15.
متن کاملA Rapidly Convergent Nonlinear Transfinite Element Procedure for Transient Thermoelastic Analysis of Temperature-Dependent Functionally Graded Cylinders
In the present paper, the nonlinear transfinite element procedure recently published by the author is improved by introducing an enhanced convergence criterion to significantly reduce the computational run-times. It is known that transformation techniques have been developed mainly for linear systems, only. Due to using a huge number of time steps, employing the conventional time integration me...
متن کاملElementary Theory of Ordinals with Addition and Left Translation by omega
After Büchi it has become very natural to interprete formulae of certain logical theories as finite automata, i.e., as recognizing devices. This recognition aspect though, was neglected by the inventor of the concept and the study of the families of linear structures that could be accepted in the language theory sense of the term, was carried out by other authors. The most popular field of appl...
متن کاملNonstandard Transfinite Digraphs
Nonstandard digraphs and transfinite digraphs have been defined and examined in two prior technical reports. The present work examines digraphs that are both nonstandard and transfinite. This requires a combination in certain ways of the techniques used in the prior two works. We first construct herein nonstandard transfinite digraphs for all the naturalnumber ranks. Then, a special kind of non...
متن کاملThe Theory of Rational Relations on Transfinite Strings
In order to explain the purpose of this paper, we recall briefly how the theory of “rationality” developed in the last fourty years. The theory of sets of finite strings recognized by finite automata, also known as regular or rational sets was developed in the fifties. It rapidly extended in two directions. Indeed, by solving the decidability problem of the second order monadic theory of one su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 10 شماره
صفحات -
تاریخ انتشار 2000