All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 58 Next

Displaying 1141 – 1160 of 5986

Showing per page

Construction of tree automata from regular expressions

Dietrich Kuske, Ingmar Meinecke (2011)

RAIRO - Theoretical Informatics and Applications

Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov's partial derivatives from regular word expressions to regular tree expressions. For an analysis of the size of the resulting automaton as well as for algorithmic improvements, we also transfer the methods of Champarnaud and Ziadi...

Construction of uninorms on bounded lattices

Gül Deniz Çaylı, Funda Karaçal (2017)

Kybernetika

In this paper, we propose the general methods, yielding uninorms on the bounded lattice ( L , ≤ , 0 , 1 ) , with some additional constraints on e ∈ L ∖ { 0 , 1 } for a fixed neutral element e ∈ L ∖ { 0 , 1 } based on underlying an arbitrary triangular norm T e on [ 0 , e ] and an arbitrary triangular conorm S e on [ e , 1 ] . And, some illustrative examples are added for clarity.

Constructions of thin-tall Boolean spaces.

Juan Carlos Martínez (2003)

Revista Matemática Complutense

This is an expository paper about constructions of locally compact, Hausdorff, scattered spaces whose Cantor-Bendixson height has cardinality greater than their Cantor-Bendixson width.

Continuous tree-like scales

James Cummings (2010)

Open Mathematics

Answering a question raised by Luis Pereira, we show that a continuous tree-like scale can exist above a supercompact cardinal. We also show that the existence of a continuous tree-like scale at ℵω is consistent with Martin’s Maximum.

Currently displaying 1141 – 1160 of 5986