On A-Trees
Đuro Kurepa (1968)
Publications de l'Institut Mathématique
Similarity:
Đuro Kurepa (1968)
Publications de l'Institut Mathématique
Similarity:
Rimlinger, Frank (1992)
Experimental Mathematics
Similarity:
D. Kurepa (1977)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Z. A. Łomnicki (1973)
Applicationes Mathematicae
Similarity:
Dietrich Kuske, Ingmar Meinecke (2011)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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...
Dietrich Kuske, Ingmar Meinecke (2011)
RAIRO - Theoretical Informatics and Applications
Similarity:
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...
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
Masayoshi Matsushita, Yota Otachi, Toru Araki (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that [k/2] ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {[k/2], . . . , k − 1}, there exist infinitely many k-trees G such...
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
Stevo Todorčević (1980)
Publications de l'Institut Mathématique
Similarity:
Tapani Hyttinen (2001)
Fundamenta Mathematicae
Similarity:
We study the possibilities of constructing, in ZFC without any additional assumptions, strongly equivalent non-isomorphic trees of regular power. For example, we show that there are non-isomorphic trees of power ω₂ and of height ω · ω such that for all α < ω₁· ω · ω, E has a winning strategy in the Ehrenfeucht-Fraïssé game of length α. The main tool is the notion of a club-guessing sequence.
Bernik, V.I., Kukso, O.S. (2005)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Molitierno, Jason J., Neumann, Michael (2001)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity: