Sciweavers

116 search results - page 8 / 24
» Operations Preserving Recognizable Languages
Sort
View
APLAS
2010
ACM
13 years 8 months ago
Data Structure Fusion
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
FSMNLP
2005
Springer
14 years 1 months ago
WFSM Auto-intersection and Join Algorithms
The join of two n-ary string relations is a main operation regarding to applications. n-Ary rational string relations are realized by weighted finite-state machines with n tapes. ...
André Kempe, Jean-Marc Champarnaud, Franck ...
DLT
2007
13 years 9 months ago
2-Visibly Pushdown Automata
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2...
Dario Carotenuto, Aniello Murano, Adriano Peron
VL
1998
IEEE
123views Visual Languages» more  VL 1998»
13 years 11 months ago
A Visual Development Environment for Parallel Applications
We report on the development of a visual programming environment for building applications for execution on a range of parallel computing platforms. This work exploits the dataflo...
Philip T. Cox, Hugh Glaser, Stuart Maclean
PPDP
2010
Springer
13 years 5 months ago
Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
Thierry Martinez