7 search results - page 1 / 2 » jalc 2007 |
JALC
2007
13 years 4 months ago
2007
JALC
2007
13 years 4 months ago
2007
JALC
2007
13 years 4 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 4 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
2007
13 years 4 months ago
2007
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...