426 search results - page 4 / 86 » Synchronization of Regular Automata |
142
Voted
CODES
2010
IEEE
15 years 16 days ago
2010
IEEE
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
134
Voted
INFORMATICALT
2000
15 years 2 months ago
2000
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
147
click to vote
ADL
2000
Springer
15 years 6 months ago
2000
Springer
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful that the XML DTDs and is clo...
123
click to vote
ACRI
2008
Springer
15 years 4 months ago
2008
Springer
Cellular automata are usually updated synchronously and thus deterministically. The question of stochastic dynamics arises in the development of cellular automata resistant to nois...
102
Voted
ITICSE
2005
ACM
15 years 8 months ago
2005
ACM
FAdo1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages. In this paper we focus in the description of in...