Sciweavers

815 search results - page 24 / 163
» Algebraic Recognizability of Languages
Sort
View
APIN
1998
98views more  APIN 1998»
14 years 11 months ago
The Evolution of Concurrent Programs
Process algebra are formal languages used for the rigorous specification and analysis of concurrent systems. By using a process algebra as the target language of a genetic program...
Brian J. Ross
JANCL
2002
113views more  JANCL 2002»
14 years 11 months ago
Canonicity and Completeness Results for Many-Valued Modal Logics
We prove frame determination results for the family of many-valued modal logics introduced by M. Fitting in the early '90s. Each modal language of this family is based on a H...
Costas D. Koutras, Christos Nomikos, Pavlos Peppas
JACM
2000
73views more  JACM 2000»
14 years 11 months ago
Parallel RAMs with owned global memory and deterministic context-free language recognition
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Wr...
Patrick W. Dymond, Walter L. Ruzzo
EDBT
2012
ACM
214views Database» more  EDBT 2012»
13 years 2 months ago
An optimization framework for map-reduce queries
We present an effective optimization framework for general SQLlike map-reduce queries, which is based on a novel query algebra and uses a small number of higher-order physical ope...
Leonidas Fegaras, Chengkai Li, Upa Gupta
DBPL
1991
Springer
98views Database» more  DBPL 1991»
15 years 3 months ago
Structural Recursion as a Query Language
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
Val Tannen, Peter Buneman, Shamim A. Naqvi