Weighted Languages Recognizable by Weighted Tree Automata | Zendy

Zsolt Gazdag | Zendy; Zoltán Fülöp | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Weighted Languages Recognizable by Weighted Tree Automata

Author(s) -

Zsolt Gazdag,

Zoltán Fülöp

Publication year - 2018

Publication title -

acta cybernetica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.143

H-Index - 18

eISSN - 2676-993X

pISSN - 0324-721X

DOI - 10.14232/actacyb.23.3.2018.9

Subject(s) - class (philosophy) , tree (set theory) , automaton , context (archaeology) , computer science , mathematics , rule based machine translation , discrete mathematics , combinatorics , theoretical computer science , artificial intelligence , paleontology , biology

Yields of recognizable weighted tree languages, yields of local weighted tree languages, and weighted context-free languages are related. It is shown that the following five classes of weighted languages are the same: (i) the class of weighted languages generated by plain weighted context-free grammars, (ii) the class of weighted languages recognized by plain weighted tree automata, (iii) the class of weighted languages recognized by deterministic and plain topdown weighted tree automata, (iv) the class of weighted languages recognized by deterministic and plain bottom-up weighted tree automata, and (v) the class of weighted languages determined by plain weighted local systems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research