3653 search results - page 196 / 731 » On Recognizable Timed Languages |
134
click to vote
ICGI
2000
Springer
15 years 9 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...
114
click to vote
IANDC
2008
15 years 5 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...
138
click to vote
IPL
2008
15 years 5 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...
172
click to vote
ISOLA
2010
Springer
15 years 3 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...
143
click to vote
PLDI
2012
ACM
13 years 7 months ago
2012
ACM
To report a compiler bug, one must often find a small test case that triggers the bug. The existing approach to automated test-case reduction, delta debugging, works by removing ...