Filters








71 Hits in 4.2 sec

On a family of L languages resulting from systolic tree automata

K. Culik, J. Gruska, A. Salomaa
1983 Theoretical Computer Science  
Recrnt work on systolic tree automata has given rise to a rather natural subfamily of EOL languages, referred to as systolic EOL languages in this paper.  ...  Systolic EOL languages possess some remarkable properties.  ...  Indeed, if we can effectively construct an EOL system accepting a gil en T-VLSI language, we can also decide problems (1) and (2) .  ... 
doi:10.1016/0304-3975(83)90032-4 fatcat:4nbwkgnfmjesdoij77yziulkgi

Temporalized logics and automata for time granularity [article]

M. Franceschet, A. Montanari
2003 arXiv   pre-print
First, we define a new class of combined automata, called temporalized automata, which can be proved to be the automata-theoretic counterpart of temporalized logics, and show that relevant properties,  ...  such as closure under Boolean operations, decidability, and expressive equivalence with respect to temporal logics, transfer from component automata to temporalized ones.  ...  Goranko, Maarten de Rijke, and Wolfgang Thomas for their positive feedback on the work reported in the paper.  ... 
arXiv:cs/0311022v1 fatcat:xeaslhxh2bapti2u2uz6ofkjiq

Temporalized logics and automata for time granularity

MASSIMO FRANCESCHET, ANGELO MONTANARI
2004 Theory and Practice of Logic Programming  
First, we define a new class of combined automata, called temporalized automata, which can be proved to be the automata-theoretic counterpart of temporalized logics, and show that relevant properties,  ...  such as closure under Boolean operations, decidability, and expressive equivalence with respect to temporal logics, transfer from component automata to temporalized ones.  ...  Goranko, Maarten de Rijke, and Wolfgang Thomas for their positive feedback on the work reported in the paper.  ... 
doi:10.1017/s147106840400208x fatcat:gum2ttgmybgsjd2virziysrlru

Cayley automata

Max Garzon
1993 Theoretical Computer Science  
The notion of a finite-state automaton is generalized to an automaton that scans as tapes arbitrary graphs preserving the properties of homogeneity and symmetry of ordinary Turing tapes.  ...  Also, the definite advantage of nondeterminism is established for Cayley automata on input graphs with at least two generators.  ...  Schupp and David E. Muller for encouragement and useful conversations.  ... 
doi:10.1016/0304-3975(93)90231-h fatcat:u7a37cfe5jdjll2ur3vpbkepyu

Page 4574 of Mathematical Reviews Vol. , Issue 98G [page]

1998 Mathematical Reviews  
Y-tree automata.  ...  We show that weak superstable systolic automata over incomplete Y-trees can accept only regu- lar languages.  ... 

Systolic tree ω-languages: the operational and the logical view

Angelo Monti, Adriano Peron
2000 Theoretical Computer Science  
-languages though maintaining the closure under union, intersection and complement and the decidability of emptiness. The class of systolic tree !  ...  -languages recognized by systolic (binary) tree automata is introduced. This class extends the class of B uchi !  ...  and closure properties of regular languages.  ... 
doi:10.1016/s0304-3975(97)00257-0 fatcat:fhu6gq2idrbpniif6q57ge2v2a

Page 2857 of Mathematical Reviews Vol. , Issue 94e [page]

1994 Mathematical Reviews  
Sci. 56 (1988), no. 2, 155-186; MR 89e:68091], the authors present results on closure properties and decision problems of languages accepted by deterministic and nondeterministic binary systolic automata  ...  Artificial Intelligence 8 (1989), no. 1, 53-82; MR 90k:68123; “Power of interconnection and of nondeterminism in regular Y-tree systolic automata”, to appear], and Fachini and Napoli [Theoret.  ... 

Page 2886 of Mathematical Reviews Vol. , Issue 84g [page]

1984 Mathematical Reviews  
Systolic EOL languages possess some remarkable properties.  ...  84g: 08 066 Authors’ summary: “Recent work on systolic tree automata has given rise to a rather natural subfamily of EOL languages, referred to as systolic EOL languages in this paper.  ... 

Page 2220 of Mathematical Reviews Vol. , Issue 91D [page]

1991 Mathematical Reviews  
Here we solve this problem by generalizing the selection problem to a decision tree problem which is defined on a full domain and to which Snir’s lower bound applies.” 91d:68018 68Q10 68Q45 68Q55 Guessarian  ...  pushdown automata and the w-Kleene closure of context-free sets.  ... 

Page 7800 of Mathematical Reviews Vol. , Issue 2002K [page]

2002 Mathematical Reviews  
This paper deals with w-languages recognizable by two other kinds of systolic automata, namely Y-tree automata and trellis automata.  ...  |Peron, Adriano] (I-UDIN-MI; Udine Logical definability of Y-tree and trellis systolic w-languages.  ... 

Page 6357 of Mathematical Reviews Vol. , Issue 89K [page]

1989 Mathematical Reviews  
) Closure properties of the family of languages defined by systolic tree automata.  ...  Summary: “The closure properties of the family of languages -/(BT) defined by systolic tree automata are investigated.  ... 

Synthesis, structure and power of systolic computations

Jozef Gruska
1990 Theoretical Computer Science  
In the second part, the power and structure or tree and linear array computations are studied in detail.  ...  Similarity with cellular automata has immediately brought into use a whole bunch of theoretical techniques to study systolic architectures, systems and computations.  ...  Decision problems, the self-embedding problems, and row-language characterization problems are related, and they are also nicely related to algebraic properties of the underlying algebras as the following  ... 
doi:10.1016/0304-3975(90)90190-s fatcat:sztlpeed4jhcdojkzi5z5zyska

Page 3942 of Mathematical Reviews Vol. , Issue 92g [page]

1992 Mathematical Reviews  
Parente, Systolic Y-tree au- tomata: closure properties and decision problems (pp. 210-219); Hans Dietmar Gréger, A new partition lemma for planar graphs and its application to circuit complexity (pp.  ...  Chlebus and Imrich Vito, Unifying binary-search trees and permutations (pp. 190-199); Jiirgen Das- sow and Klaus-Jérn Lange, Computational complexity and hardest languages of automata with abstract storages  ... 

Subject index volumes 1–200

1999 Theoretical Computer Science  
of -, 730 systolic ring, 730 schemes, 1062 system, 633 systems, 1062, 1333 tree automata, 477, I S64 trees, 453 systems, simulations of -, 1333 systolic trellis automata, 580 computational complexity  ...  convolution, 1768 of arithmetic functions, 1768 systolic design, 1436 EOL languages, 477 flowchart. 1062 systolic language recognition, 453 by tree automata, 453 systolic networks, 730 design  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Cumulative index volumes 1–100

1992 Theoretical Computer Science  
Sangiorgi, Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata 83 (2) ( I99 I ) 249- 260 43 (2-3) ( 1986) 189-200 Fagin, R.  ...  Napoli, C-tree systolic automata 56 (2) ( 1988) 155-l 86 Fachini. E., A. Maggiolo Schettini, G. Resta and D.  ... 
doi:10.1016/0304-3975(92)90292-n fatcat:ekwes6owtrco3lkfkiqagnketq
« Previous Showing results 1 — 15 out of 71 results