Multiple Regularity and Binary ETOL-Systems1

1981 ◽  
Vol 4 (1) ◽  
pp. 19-34
Author(s):  
Ryszard Danecki
Keyword(s):  
Equivalence Problem ◽  
Tree Automata ◽  
Closure Properties ◽  
Multiple Tree

Closure properties of binary ETOL-languages are investigated by means of multiple tree automata. Decidability of the equivalence problem of deterministic binary ETOL-systems is proved.

scholarly journals Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata

1991 ◽  
Vol 83 (2) ◽  
pp. 249-260 ◽  
Author(s):  
E. Fachini ◽  
A. Maggiolo Schettini ◽  
G. Resta ◽  
D. Sangiorgi
Keyword(s):  
Tree Automata ◽  
Closure Properties

PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS

1992 ◽  
Vol 03 (01) ◽  
pp. 21-39 ◽  
Author(s):  
A. SAOUDI
Keyword(s):  
Equivalence Problem ◽  
Tree Automata ◽  
Top Down ◽  
Infinite Trees ◽  
Infinite Tree ◽  
Context Free ◽  
Pushdown Automata

We introduce various types of top-down pushdown infinite tree automata. We extend the Landweber-Staiger-Wagner hierarchy to pushdown infinite tree automata. We prove that the extension of Kleene’s theorem to pushdown infinite tree automata is not possible. We characterize recognizable (i.e. regular) infinite trees and extend Eilenberg’s theorem to ω-tree pushdown automata. We give some characterizations of infinite computations of nondeterministic context-free program schemes. We show that the equivalence problem for nondeterministic context-free program schemes is unsolvable.

Equivalence problem of Mann and Ishikawa Iterations in Banach Spaces

2011 ◽  
Vol 12 (3) ◽  
pp. 279-288
Author(s):  
Shuang WANG ◽  
Guoqing CHAI ◽  
Changsong HU
Keyword(s):  
Banach Spaces ◽  
Equivalence Problem

scholarly journals Equivalence problem for the orthogonal webs on the 3-sphere

2011 ◽  
Vol 52 (5) ◽  
pp. 053509 ◽  
Author(s):  
Caroline M. Cochran ◽  
Raymond G. McLenaghan ◽  
Roman G. Smirnov
Keyword(s):  
Equivalence Problem

On metalinear ETOL systems

1980 ◽  
Vol 3 (1) ◽  
pp. 15-36
Author(s):  
Grzegorz Rozenberg ◽  
Dirk Vermeir
Keyword(s):  
Finite Index ◽  
Closure Properties ◽  
Pumping Lemma ◽  
L Systems ◽  
Structural Characterizations

The concept of metalinearity in ETOL systems is investigated. Some structural characterizations, a pumping lemma and the closure properties of the resulting class of languages are established. Finally, some applications in the theory of L systems of finite index are provided.

Sign in / Sign up

Export Citation Format

Share Document