Sciweavers

2944 search results - page 109 / 589
» On Well Quasi-orders on Languages
Sort
View
CSR
2007
Springer
14 years 4 months ago
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
Artur Jez, Alexander Okhotin
TBILLC
2007
Springer
14 years 4 months ago
Expressing Belief Flow in Assertion Networks
In the line of some earlier work done on belief dynamics, we an abstract model of belief propagation on a graph based on the methodology of the revision theory of truth. A modal la...
Sujata Ghosh, Fernando R. Velázquez-Quesada
GRC
2005
IEEE
14 years 3 months ago
An evolution strategy for the induction of fuzzy finite-state automata
: This study presents an evolution strategy used to infer fuzzy finite-state automata from examples of a fuzzy language. We describe the fitness function of an generated automata w...
Zhiwen Mo, Min Wan, Lan Shu
VL
2005
IEEE
102views Visual Languages» more  VL 2005»
14 years 3 months ago
Using Objects of Measurement to Detect Spreadsheet Errors
There are many common spreadsheet errors that traditional spreadsheet systems do not help users find. This paper presents a statically-typed spreadsheet language that adds additio...
Michael J. Coblenz, Andrew Jensen Ko, Brad A. Myer...
PPSWR
2004
Springer
14 years 3 months ago
Data Retrieval and Evolution on the (Semantic) Web: A Deductive Approach
To make use of data represented on the Semantic Web, it is necessary to provide languages for Web data retrieval and evolution. This article introduces into the (conventional and S...
François Bry, Tim Furche, Paula-Lavinia Pat...