Idempotent tree languages
Work
Year: 2013
Type: article
Abstract: A tree language of a fixed type τ is any set of terms of type τ . We consider here a binary operation + n on the set W τ ( X n ) of all n -ary terms of type τ , which results in semigroup ( W τ ( X n... more
Source: Demonstratio Mathematica
Institutions University of Potsdam, University of Lethbridge
Cites: 7
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
APC paid (est): $1,078