We consider the problems of efficiently diagnosing (and predicting) what did will) happen after a given sequence observations execution partially observable one-clock timed automaton. This is made difficult by facts that automata are infinite-state systems, and they can in general not be determinized. introduce markings as formalism to keep track evolution set reachable configurations over time...

To deal with system uncertainty, finite automata have been generalized into fuzzy automata. Stamenkovic and Ciric proposed an approach using the position automata for the construction of fuzzy automata from fuzzy regular expressions. There exist multifarious methodologies for the construction of finite automata from regular expressions known as Thompson construction, Antimirov partial derivativ...

Watson Crick automata are finite automata working on double strands. Extensive research work has already been done on non deterministic Watson Crick automata and on deterministic Watson Crick automata. Parallel Communicating Watson Crick automata systems have been introduced by E. Czeziler et al. In this paper we discuss about a variant of Watson Crick automata known as the two-way Watson Crick...

for wireless ommuni ation systems Mehmet Akar Urbashi Mitra Department of Ele tri al Engineering Department of Ele tri al Engineering Yale University, P.O. Box 208267 The Ohio State University New Haven, CT 06520-8267 Columbus, OH 43210 akar koshy.eng.yale.edu ubli ee.eng.ohio-state.edu Abstra t|Various suboptimal hando algorithms for ellular ommuni ation systems based on signal strength measur...

In this paper, we compare the computational power of two-way Watson–Crick automata and Quantum finite automata. The language $${\text{L}} = \left\{ {\left. {{\text{xx}}} \right|{\text{x}} \in {{\mathbf{a}},{\mathbf{b}}} \right\}^{*} } \right\}$$ is accepted by but not quantum

with the explosive growth in amount of information, it is highly required to utilize tools and methods in order to search, filter and manage resources. one of the major problems in text classification relates to the high dimensional feature spaces. therefore, the main goal of text classification is to reduce the dimensionality of features space. there are many feature selection methods. however...

In this study an efficient meta-heuristic is proposed for layout optimization of truss structures by combining cellular automata (CA) and firefly algorithm (FA). In the proposed meta-heuristic, called here as cellular automata firefly algorithm (CAFA), a new equation is presented for position updating of fireflies based on the concept of CA. Two benchmark examples of truss structures are presen...

The Cellular Automata method has been used to simulate the pattern formation of the Schlögl model as a bistable Reaction-Diffusion System. Both microscopic and macroscopic Cellular Automata approaches have been considered and two different methods for obtaining the probabilities in the microscopic approach have been mentioned. The results show the tendency of the system towards the more sta...

Abstract We extend the $$\mathtt {L}^{\!\star }$$ L⋆ algorithm to learn bimonoids recognising pomset languages. then identify a class of automata that accepts precisely languages recognised by and show how convert between automata.