Topic
ω-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.
Papers published on a yearly basis
Papers
More filters
01 Jan 2007
TL;DR: It is shown that the approximation of fuzzy finite automata can be approximate by some DFFA with any given accuracy even the NFFA is not equivalent to any D FFA, related construction is presented.
Abstract: We have shown that nondeterministic fuzzy finite automata (or NFFAs, for short) and deterministic fuzzy finite automata (or DFFAs, for short) are not necessary to be equivalent in the previous work. We continue to study the approximation of fuzzy finite automata in this paper. In particular, we show that we can approximate an NFFA by some DFFA with any given accuracy even the NFFA is not equivalent to any DFFA, related construction is also presented. Some characterizations of NFFA and DFFA are given.
01 May 2006
TL;DR: The idea is to theoretically trace the output of the circuit implementing the next state functions of the Automaton, determine the time frames when these outputs are logically correct and use those specific moments of time to provoke the automaton's evolution towards the next correct state.
Abstract: The present paper considers the problem of digital hazards that are present in combinatorial logic structures. My work is focused not on eliminating these hazards but on how to avoid and eventually use this unwanted feature when we are designing a digital automaton. The idea is to theoretically trace the output of the circuit implementing the next state functions of the automaton, determine the time frames when these outputs are logically correct and use those specific moments of time to provoke the automaton's evolution towards the next correct state (according to the automaton's states transitions graph). By doing so we shall drastically improve the working speed of the automaton we design.
TL;DR: This formulation characterizes automata as recognition devices in terms of a set of rewriting rules, similar to the characterizatibn of Automata as generating devices by grammars.
Abstract: A production on T* is a rewriting rule σα→σ' for all aϵ T*, where σ, σ' are strings in T* with a' lexicographically earlier than σ. Any finite collection of productions is called a system. This note shows that any system that is consistent, complete, and has the nonprefix property uniquely represents an automaton. This formulation characterizes automata as recognition devices in terms of a set of rewriting rules, similar to the characterizatibn of automata as generating devices by grammars.
12 Jul 2003
TL;DR: This work defines a variant of binding-blocking automata called as string binding- blocking automata and analyze the acceptance power of the new model, which is very similar to a BBA but for the blocking and unblocking.
Abstract: In a similar way to DNA hybridization, antibodies which specifically recognize peptide sequences can be used for calculation [3,4]. In [4] the concept of peptide computing via peptide-antibody interaction is introduced and an algorithm to solve the satisfiability problem is given. In [3], (1) it is proved that peptide computing is computationally complete and (2) a method to solve two well-known NP-complete problems namely Hamiltonian path problem and exact cover by 3-set problem (a variation of set cover problem) using the interactions between peptides and antibodies is given. In our earlier paper [1], we proposed a theoretical model called as bindingblocking automata (BBA) for computing with peptide-antibody interactions. In [1] we define two types of transitions leftmost(l) and locally leftmost(ll) of BBA and prove that the acceptance power of multihead finite automata is sandwiched between the acceptance power of BBA in l and ll transitions. In this work we define a variant of binding-blocking automata called as string binding-blocking automata and analyze the acceptance power of the new model. The model of binding-blocking automaton can be informally said as a finite state automaton (reading a string of symbols at a time) with (1) blocking and unblocking functions and (2) priority relation in reading of symbols. Blocking and unblocking facilitates skipping 1 some symbols at some instant and reading it when it is necessary. In the sequel we state some results from [1,2] (1) for every BBA there exists an equivalent BBA without priority, (2) for every language accepted by BBA with l transition, there exists BBA with ll transitions accepting the same language, (3) for every language accepted by BBA with l transition there is an equivalent multi-head finite automata which accepts the same language and (4) for every language L accepted by a multi-head finite automaton there is a language L′ accepted by BBA such that L can be written in the form h−1(L′) where h is a homomorphism from L to L′. The basic model of the string binding-blocking automaton is very similar to a BBA but for the blocking and unblocking. Some string of symbols (starting form the head’s position) can be blocked from being read by the head. So only those symbols which are not already read and not blocked can be read by the head. The finite control of the automaton is divided into three sets of states namely blocking states, unblocking states and general reading states. A read symbol can not be read gain, but a blocked symbol can be unblocked and read.
TL;DR: The idea of this paper is to provideAlternating automata with a start formula, which allows to define a collection of sets of infinite trees by one automaton, and the existence of universal automate is proved.