Inscriere cercetatori

Daca aveti cont Ad Astra si de Facebook, intrati pe pagina de profil pentru a da dreptul sa va logati pe site doar cu acest buton.

Site nou !

Daca nu va puteti recupera parola (sau aveti alte probleme), scrieti-ne la pagina de contact. Situl vechi se gaseste la adresa


Grammatical Inference and Symbolic Dynamics

Domenii publicaţii > Ştiinţe informatice + Tipuri publicaţii > Articol în volumul unei conferinţe

Autori: Gabriel Istrate

Editorial: 5th European Conference on Complex Systems (ECCS'08), Jerusalem, Israel, September 14-19, 2008, 2008.


Want create site? Find Free WordPress Themes and plugins.

[Published only as an abstract on the conference website. Full-length paper to follow]

We show that Lindenmayer systems can be learned in polynomial time from membership and equivalence queries (that is queries are syntax trees of the corresponding grammar).

The result is directly motivated by (and can be applied to) the problem of
learning the symbolic representations associated to dynamical systems induced by unimodal (and several classes of multimodal) maps. Particular cases
of interest include the ones when they arise via operators on kneading sequences, such as renormalization and
composition rules. Learning syntax trees amounts to learning these structural mechanisms.

Did you find apk for android? You can find new Free Android Games and apps.

Cuvinte cheie: grammatical inference, ET0L languages, applied symbolic dynamics