8 search results - page 1 / 2 » jalc 2008 |
JALC
2007
13 years 5 months ago
2007
JALC
2007
13 years 5 months ago
2007
JALC
2007
13 years 5 months ago
2007
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
JALC
2007
13 years 5 months ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
JALC
2008
13 years 5 months ago
2008
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...