Matches in SemOpenAlex for { <https://semopenalex.org/work/W3080321650> ?p ?o ?g. }
Showing items 1 to 53 of
53
with 100 items per page.
- W3080321650 abstract "Forest algebras are defined for investigating languages of forests [ordered sequences] of unranked trees, where a node may have more than two [ordered] successors. They consist of two monoids, the horizontal and the vertical, with an action of the vertical monoid on the horizontal monoid, and a complementary axiom of faithfulness. A pseudovariety is a class of finite algebras of a given signature, closed under the taking of homomorphic images, subalgebras and finitary direct products. By looking at the syntactic congruence for monoids and as the natural extension in the case of forest algebras, we could define a version of syntactic congruence of a subset of the free forest algebra, not just a forest language. Let [Formula: see text] be a finite alphabet and [Formula: see text] be a pseudovariety of finite forest algebras. A language [Formula: see text] is [Formula: see text]-recognizable if its syntactic forest algebra belongs to [Formula: see text]. Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class. Suppose that a forest language [Formula: see text] and a forest [Formula: see text] are given. We want to find if there exists any proof for that [Formula: see text] does not belong to [Formula: see text] just by using [Formula: see text]-recognizable languages, i.e. given such [Formula: see text] and [Formula: see text], if there exists a [Formula: see text]-recognizable language [Formula: see text] which contains [Formula: see text] and does not contain [Formula: see text]. In this paper, we present how one can use profinite forest algebra to separate a forest language and a forest term and also to separate two forest languages." @default.
- W3080321650 created "2020-09-01" @default.
- W3080321650 creator A5028642208 @default.
- W3080321650 creator A5090820797 @default.
- W3080321650 date "2020-08-01" @default.
- W3080321650 modified "2023-10-17" @default.
- W3080321650 title "Weak Separation Problem for Tree Languages" @default.
- W3080321650 cites W1515534319 @default.
- W3080321650 cites W1849255017 @default.
- W3080321650 cites W1949820592 @default.
- W3080321650 cites W1971672075 @default.
- W3080321650 cites W1972229280 @default.
- W3080321650 cites W1988683807 @default.
- W3080321650 cites W2017081972 @default.
- W3080321650 cites W2105140228 @default.
- W3080321650 cites W2591424239 @default.
- W3080321650 cites W4211152277 @default.
- W3080321650 doi "https://doi.org/10.1142/s0129054120500276" @default.
- W3080321650 hasPublicationYear "2020" @default.
- W3080321650 type Work @default.
- W3080321650 sameAs 3080321650 @default.
- W3080321650 citedByCount "0" @default.
- W3080321650 crossrefType "journal-article" @default.
- W3080321650 hasAuthorship W3080321650A5028642208 @default.
- W3080321650 hasAuthorship W3080321650A5090820797 @default.
- W3080321650 hasConcept C114614502 @default.
- W3080321650 hasConcept C118615104 @default.
- W3080321650 hasConcept C206901836 @default.
- W3080321650 hasConcept C2778003309 @default.
- W3080321650 hasConcept C33923547 @default.
- W3080321650 hasConceptScore W3080321650C114614502 @default.
- W3080321650 hasConceptScore W3080321650C118615104 @default.
- W3080321650 hasConceptScore W3080321650C206901836 @default.
- W3080321650 hasConceptScore W3080321650C2778003309 @default.
- W3080321650 hasConceptScore W3080321650C33923547 @default.
- W3080321650 hasFunder F4320334779 @default.
- W3080321650 hasLocation W30803216501 @default.
- W3080321650 hasOpenAccess W3080321650 @default.
- W3080321650 hasPrimaryLocation W30803216501 @default.
- W3080321650 hasRelatedWork W10324078 @default.
- W3080321650 hasRelatedWork W12087616 @default.
- W3080321650 hasRelatedWork W12431398 @default.
- W3080321650 hasRelatedWork W2048510 @default.
- W3080321650 hasRelatedWork W403955 @default.
- W3080321650 hasRelatedWork W5863571 @default.
- W3080321650 hasRelatedWork W6335828 @default.
- W3080321650 hasRelatedWork W6748139 @default.
- W3080321650 hasRelatedWork W8862051 @default.
- W3080321650 hasRelatedWork W11017067 @default.
- W3080321650 isParatext "false" @default.
- W3080321650 isRetracted "false" @default.
- W3080321650 magId "3080321650" @default.
- W3080321650 workType "article" @default.