4666 search results - page 323 / 934 » Equations on Timed Languages |
167
Voted
ICGI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
136
click to vote
IANDC
2008
15 years 6 months ago
2008
Abstract. Boolean grammars are an extension of context-free grammars, in which all propositional connectives are allowed. In this paper, the notion of ambiguity in Boolean grammars...
157
click to vote
IPL
2008
15 years 6 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
206
click to vote
ISOLA
2010
Springer
15 years 4 months ago
2010
Springer
The HATS project develops a formal method for the design, analysis, and implementation of highly adaptable software systems that are at the same time characterized by a high demand...
153
click to vote
HASKELL
2009
ACM
16 years 1 months ago
2009
ACM
We present by example a new application domain for functional languages: emulators for embedded real-time protocols. As a casestudy, we implement a simple emulator for the Biphase...