We present a generalized disambiguation algorithm of finite state automata, and show a proof of its correctness. This algorithm can remove ambiguities of finite state and tree automata. Our proposed algorithm can make finite state and tree automata more efficient to use in many applications.

We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three different ways, using three different kinds of finite automata running on infinite words (Büchi automata): finite automata with two input tapes, selectors and shufflers. We give an algorithm to construct a pair of fi...

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

This paper relates the computational power of Fahlman' s Recurrent Cascade Correlation (RCC) architecture to that of fInite state automata (FSA). While some recurrent networks are FSA equivalent, RCC is not. The paper presents a theoretical analysis of the RCC architecture in the form of a proof describing a large class of FSA which cannot be realized by RCC.

Come with us to read a new book that is coming recently. Yeah, this is a new coming book that many people really want to read will you be one of them? Of course, you should be. It will not make you feel so hard to enjoy your life. Even some people think that reading is a hard to do, you must be sure that you can do it. Hard will be felt when you have no ideas about what kind of book to read. Or...

Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic finite automata, where the conditions for merging states can be efficiently computed. The matter is more complex in the case of non-deterministic finite automata, where merging states can be done in different ways, and the...

Article history: Received 16 January 2010 Received in revised form 21 December 2011 Accepted 7 February 2012 Available online 10 February 2012

In this report I will give proofs of some simple theorems concerning continued fractions that are known to the cognoscenti, but for which proofs in the literature seem to be missing, incomplete, or hard to locate. In particular, I will give two proofs of the following “folk theorem”: if θ is an irrational number whose continued fraction has bounded partial quotients, then any non-trivial linear...

We complete the initial study of jumping finite automata, which was started in a former article of Meduna and Zemek [6]. The open questions about basic closure properties are solved. Besides this, we correct erroneous results presented in the article. Finally, we point out important relations between jumping finite automata and some other models studied in the literature.