scholarly journals A Lexicographical order induced by Schauder Bases

2020 ◽  
Author(s):  
Neset TAN
Keyword(s):  
Lexicographical Order ◽  
Schauder Bases

DESIGNING A SYSTOLIC ALGORITHM FOR GENERATING WELL-FORMED PARENTHESIS STRINGS

2004 ◽  
Vol 14 (01) ◽  
pp. 83-97
Author(s):  
JONG-CHUANG TSAY
Keyword(s):  
Linear Array ◽  
Vlsi Implementation ◽  
Processor Array ◽  
Lexicographical Order ◽  
Systolic Algorithm ◽  
Left And Right ◽  
Local Connection

A parenthesis string is a string of left and right parentheses. The string is well-formed when it consists of balanced pairs of left and right parentheses. This study presents a novel systolic algorithm for generating all the well-formed parenthesis strings in lexicographical order. The algorithm is cost-optimal and is run on a linear array of processors such that each well-formed parenthesis string can be generated in three time steps. The processor array is appropriate for VLSI implementation, since it has the features of modularity, regularity, and local connection.

Schauder Bases

1978 ◽  
Vol 85 (4) ◽  
pp. 256-257
Author(s):  
P. R. Halmos
Keyword(s):  
Schauder Bases

On the equivalence of weak and Schauder bases

1986 ◽  
Vol 46 (5) ◽  
pp. 447-452 ◽  
Author(s):  
Jos� Orihuela
Keyword(s):  
Schauder Bases
Sign in / Sign up

Export Citation Format

Share Document