Sciweavers

426 search results - page 25 / 86
» Synchronization of Regular Automata
Sort
View
IJFCS
2008
158views more  IJFCS 2008»
13 years 9 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
CSL
2003
Springer
14 years 2 months ago
Automata on Lempel-ziv Compressed Strings
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...
Hans Leiß, Michel de Rougemont
STRINGOLOGY
2008
13 years 10 months ago
The Road Coloring and Cerny Conjecture
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
Avraham Trahtman
ENTCS
2008
125views more  ENTCS 2008»
13 years 9 months ago
Extending Lustre with Timeout Automata
This paper describes an extension to Lustre to support the analysis of globally asynchronous, locally synchronous (GALS) architectures. This extension consists of constructs for d...
Jimin Gao, Mike Whalen, Eric Van Wyk
VLSISP
2008
140views more  VLSISP 2008»
13 years 8 months ago
Regular Expression Matching in Reconfigurable Hardware
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
Ioannis Sourdis, João Bispo, João M....