ω-automaton

About: ω-automaton is a research topic. Over the lifetime, 2299 publications have been published within this topic receiving 68468 citations. The topic is also known as: stream automaton & ω-automata.

Some minimality results on biresidual and biseparable automata

Abstract: Residual finite state automata (RFSA) are a subclass of nondeterministic finite automata (NFA) with the property that every state of an RFSA defines a residual language of the language accepted by the RFSA. Recently, a notion of a biresidual automaton (biRFSA) – an RFSA such that its reversal automaton is also an RFSA – was introduced by Latteux, Roos, and Terlutte, who also showed that a subclass of biRFSAs called biseparable automata consists of unique state-minimal NFAs for their languages. In this paper, we present some new minimality results concerning biRFSAs and biseparable automata. We consider two lower bound methods for the number of states of NFAs – the fooling set and the extended fooling set technique – and present two results related to these methods. First, we show that the lower bound provided by the fooling set technique is tight for and only for biseparable automata. And second, we prove that the lower bound provided by the extended fooling set technique is tight for any language accepted by a biRFSA. Also, as a third result of this paper, we show that any reversible canonical biRFSA is a transition-minimal e-NFA. To prove this result, the theory of transition-minimal e-NFAs by S. John is extended.

On somewhat fuzzy automata continuous functions in fuzzy automata topological spaces

Abstract: In this paper, the concepts of somewhat fuzzy automata continuous functions and somewhat fuzzy automata open functions in fuzzy automata topological spaces are introduced and some interesting properties of these functions are studied. In this connection, the concepts of fuzzy automata resolvable spaces and fuzzy automata irresolvable spaces are also introduced and their properties are studied.

in Fuzzy Automata

Abstract: The purpose of this paper to study homomorphism of γ- synchronized automata and proved that every homomorphic image of a γsynchronized automata is also a γ-synchronized automata.

Cell-centric heuristics for the classification of cellular automata

Abstract: We study the classification of cellular-automaton update rules into Wolfram's four classes. We start with the notion of the input entropy of a spatiotemporal block in the evolution of a cellular automaton, and build on it by introducing two novel entropy measures, one that is also based on inputs to the cells, the other based on state transitions by the cells. Our two new entropies are both targeted at the classification of update rules by parallel machines, being therefore mindful of the necessary communications requirements; we call them cell-centric input entropy and cell-centric transition entropy to reflect this fact. We report on extensive computational experiments on both one- and two-dimensional cellular automata. These experiments allow us to conclude that the two new entropies possess strong discriminatory capabilities, therefore providing valuable aid in the classification process.