Iterated Uniform Finite-State Transducers

The time complexity of the unary exact real algorithm which computes a M¨ obius transformation depends on the growth of its inner state matrices during the computation.. Heckmann

¥ If Universe is filled with cosmological constant – its energy density does not change.. ¥ If Universe is filled with anything with non-negative pressure: the density decreases as

In fact, we propose two formalizations: in the first one, mutations are processed by directly storing the lexical forms with mutations in a dictionary of inflected forms; in the

We provide formal definitions of the construction of the parser and of the operation of the algorithm and we prove that the parser can be built for a large class of

We can mention, for instance, the Back and Forth Nudging proposed by Auroux and Blum [1], the Time Reversal Focusing by Phung and Zhang [10], the algorithm proposed by Ito, Ramdani

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

Extending 2DFTs with non-determinism does not increase their expressive power when they define functions: non-deterministic two-way finite state transducers (2NFTs) that are

Moreover some additional elements are proposed to enrich the standard FSM model such as the genericity that permits to define simultaneously multiple states, transitions or