Sciweavers

240 search results - page 7 / 48
» Infinite trace equivalence
Sort
View
ACTA
2005
96views more  ACTA 2005»
13 years 8 months ago
Families of automata characterizing context-sensitive languages
In the hierarchy of infinite graph families, rational graphs are defined by rational transducers with labelled final states. This paper proves that their traces are precisely conte...
Christophe Morvan, Chloe Rispal
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
14 years 2 months ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
EATCS
2002
60views more  EATCS 2002»
13 years 8 months ago
Roadmap of Infinite Results
Abstract. This paper provides a comprehensive summary of equivalence checking results for infinite-state systems. References to the relevant papers will be updated continuously acc...
Jirí Srba
POPL
2008
ACM
14 years 9 months ago
Subcubic algorithms for recursive state machines
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
Swarat Chaudhuri
TPLP
2008
89views more  TPLP 2008»
13 years 8 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...