2474 search results - page 9 / 495 » Learning Languages in a Union |
ALT
2005
Springer
14 years 4 months ago
2005
Springer
ML
2007
ACM
13 years 7 months ago
2007
ACM
ACSD
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
ITA
2008
13 years 7 months ago
2008
A language L A is literally idempotent in case that ua2 v L if and only if uav L, for each u, v A , a A. Varieties of literally idempotent languages result naturally by taking...
FUIN
2008
13 years 7 months ago
2008
: We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate t...