Sciweavers

346 search results - page 33 / 70
» Determinizing Asynchronous Automata
Sort
View
DLT
2003
14 years 11 months ago
On Deterministic Finite Automata and Syntactic Monoid Size, Continued
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semi...
Markus Holzer, Barbara König
ETFA
2006
IEEE
15 years 4 months ago
Optimizing Quality of Control in Networked Automation Systems using Probabilistic Models
New technological trends lead to the increasing use of network technologies in automation. Especially the Ethernet with TCP/IP and wireless networks find growing acceptance. The r...
Jürgen Greifeneder, Georg Frey
FSMNLP
2005
Springer
15 years 3 months ago
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
Alexander Geyken, Thomas Hanneforth
SACMAT
2009
ACM
15 years 4 months ago
Towards formal security analysis of GTRBAC using timed automata
An access control system is often viewed as a state transition system. Given a set of access control policies, a general safety requirement in such a system is to determine whethe...
Samrat Mondal, Shamik Sural, Vijayalakshmi Atluri
BIOSYSTEMS
2008
129views more  BIOSYSTEMS 2008»
14 years 10 months ago
Reconstruction of DNA sequences using genetic algorithms and cellular automata: Towards mutation prediction?
Change of DNA sequence that fuels evolution is, to a certain extent, a deterministic process because mutagenesis does not occur in an absolutely random manner. So far, it has not ...
Ch. Mizas, Georgios Ch. Sirakoulis, Vasilios A. Ma...