Sciweavers

116 search results - page 10 / 24
» Minimization of Automata
Sort
View
ICGI
2010
Springer
14 years 11 months ago
Inferring Regular Trace Languages from Positive and Negative Samples
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
Antonio Cano Gómez
HIS
2004
14 years 11 months ago
A Fuzzy Clustering Algorithm using Cellular Learning Automata based Evolutionary Algorithm
In this paper, a new fuzzy clustering algorithm that uses cellular learning automata based evolutionary computing (CLA-EC) is proposed. The CLA-EC is a model obtained by combining...
Reza Rastegar, A. R. Arasteh, Arash Hariri, Mohamm...
DLT
2007
14 years 11 months ago
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
Hermann Gruber, Markus Holzer
WIA
2005
Springer
15 years 3 months ago
Shorter Regular Expressions from Finite-State Automata
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
Yo-Sub Han, Derick Wood
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 9 months ago
Dynamic Observers for Fault Diagnosis of Timed Systems
Abstract-- In this paper we extend the work on dynamic observers for fault diagnosis [1], [2], [3] to timed automata. We study sensor minimization problems with static observers an...
Franck Cassez