Sciweavers

426 search results - page 13 / 86
» Synchronization of Regular Automata
Sort
View
JAC
2008
13 years 9 months ago
Two-dimensional cellular automata recognizer equipped with a path
In this paper, two-dimensional cellular automata as one-dimensional language recognizers are considered. Following the approach of M. Delorme and J. Mazoyer to embed one-dimensiona...
Véronique Terrier
ISOLA
2004
Springer
14 years 1 months ago
Embedding Finite Automata within regular Expressions
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
WIA
2009
Springer
14 years 2 months ago
Short Regular Expressions from Finite Automata: Empirical Results
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
Hermann Gruber, Markus Holzer, Michael Tautschnig
CONCUR
2010
Springer
13 years 8 months ago
Kleene, Rabin, and Scott Are Available
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger ...
ADBIS
2009
Springer
108views Database» more  ADBIS 2009»
14 years 2 months ago
Linear Systems for Regular Hedge Languages
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...
Mircea Marin, Temur Kutsia