Classes of Tree Languages and DR Tree Languages Given by Classes of Semigroups | Zendy

Ferenc Gécseg | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Classes of Tree Languages and DR Tree Languages Given by Classes of Semigroups

Author(s) -

Ferenc Gécseg

Publication year - 2011

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.20.2.2011.3

Subject(s) - tree (set theory) , class (philosophy) , property (philosophy) , abstract family of languages , mathematics , computer science , root (linguistics) , cone (formal languages) , section (typography) , string (physics) , discrete mathematics , combinatorics , second generation programming language , linguistics , programming language , artificial intelligence , inductive programming , philosophy , epistemology , programming paradigm , mathematical physics , operating system

In the first section of the paper we give general conditions under which a class of recognizable tree languages with a given property can be defined by a class of monoids or semigroups defining the class of string languages having the same property. In the second part similar questions are studied for classes of (DR) tree languages recognized by deterministic root-to-frontier tree recognizers.

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