Comments on Complete Sets of Tree Automata

Author(s):  
Ferenc Gécseg
Keyword(s):  
1981 ◽  
Vol 4 (1) ◽  
pp. 19-34
Author(s):  
Ryszard Danecki

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.


1989 ◽  
Vol 12 (4) ◽  
pp. 571-585
Author(s):  
E. Fachini ◽  
A. Maggiolo Schettini ◽  
G. Resta ◽  
D. Sangiorgi

We prove that the classes of languages accepted by systolic automata over t-ary trees (t-STA) are always either equal or incomparable if one varies t. We introduce systolic tree automata with base (T(b)-STA), a subclass of STA with interesting properties of modularity, and we give a necessary and sufficient condition for the equivalence between a T(b)-STA and a t-STA, for a given base b. Finally, we show that the stability problem for T(b)-ST A is decidible.


2021 ◽  
Vol 2021 (5) ◽  
Author(s):  
Francisca Carrillo-Morales ◽  
Francisco Correa ◽  
Olaf Lechtenfeld

Abstract For the rational quantum Calogero systems of type A1⊕A2, AD3 and BC3, we explicitly present complete sets of independent conserved charges and their nonlinear algebras. Using intertwining (or shift) operators, we include the extra ‘odd’ charges appearing for integral couplings. Formulæ for the energy eigenstates are used to tabulate the low-level wave functions.


2013 ◽  
Vol 46 (48) ◽  
pp. 485303 ◽  
Author(s):  
Jukka Kiukas ◽  
Jussi Schultz
Keyword(s):  

1974 ◽  
Vol 15 (10) ◽  
pp. 1787-1799 ◽  
Author(s):  
B. R. Judd ◽  
W. Miller ◽  
J. Patera ◽  
P. Winternitz

Sign in / Sign up

Export Citation Format

Share Document