Sciweavers

756 search results - page 108 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
CAI
2011
Springer
12 years 11 months ago
Theme and Variations on the Concatenation Product
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and pro...
Jean-Éric Pin
MCMASTER
1993
14 years 7 days ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
ALT
2008
Springer
14 years 5 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 8 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
ATAL
2006
Springer
13 years 10 months ago
On proactivity and maintenance goals
Goals are an important concept in intelligent agent systems, and can take a variety of forms. One such form is maintenance goals, which, unlike achievement goals, define states th...
Simon Duff, James Harland, John Thangarajah