Filters








115 Hits in 4.1 sec

C-tree systolic automata

E. Fachini, M. Napoli
1988 Theoretical Computer Science  
A new type of systolic automaton is introduced, its structural properties, such as homogeneity and stability, are investigated and the class of languages accepted by these automata is studied.  ...  A characterization of the deIined model is also given in terms of sequential machines.  ...  Moreover, the class of languages accepted by nondeterministic systolic binary tree automata coincides with the class of languages accepted by deterministic systolic binary tree automata and, finally, an  ... 
doi:10.1016/0304-3975(88)90076-x fatcat:nnijmwqefza5tnq46spzqpo5mq

Cayley automata

Max Garzon
1993 Theoretical Computer Science  
Cayley graph languages accepted by halting Cayley automata are syntactically characterized by quantifierfree formulas in the first-order theory of groups with parameters, the generators of the input Cayley  ...  Also, the definite advantage of nondeterminism is established for Cayley automata on input graphs with at least two generators.  ...  In order to characterize Cayley graph languages recognized by halting automata, it is necessary to introduce a special kind of Cayley automata, which are below parametrized by systems of equations and  ... 
doi:10.1016/0304-3975(93)90231-h fatcat:u7a37cfe5jdjll2ur3vpbkepyu

A kleene-like characterization of languages accepted by systolic tree automata

E. Fachini, A. Monti
1994 Journal of computer and system sciences (Print)  
We present a Kleen-like characterization of the class of languages accepted by systolic binary tree automata, L(SBTA).  ...  This characterization uses union, intersection, restricted concatenation, restricted concatenation closure, and finite substitution closure.  ...  INTRODUCTION In this paper we present a Kleene-like characterization of the class of languages accepted by systolic binary tree automata, L(SBTA).  ... 
doi:10.1016/s0022-0000(05)80090-x fatcat:wysodxx4qfgcjfae4bcc424p4e

Characterizations and computational complexity of systolic trellis automata

Oscar H. Ibarra, Sam M. Kim
1984 Theoretical Computer Science  
Systolic trellis automata are simple models for VLSI. We characterize the computing power of these models in terms of Turing machines.  ...  The characterizations are useful in proving new results as well as giving simpler proofs of known results.  ...  , 1 &I, J es the language or set accepted by M and is called an NSTM-lanpuage. .Y'(NSTM) Jenotes the class of all NSTM-languages. Characterizations of systolic trellis automata 127 Definition.  ... 
doi:10.1016/0304-3975(84)90015-x fatcat:54hxufkbbrdzzahanbcr5absma

Temporalized logics and automata for time granularity [article]

M. Franceschet, A. Montanari
2003 arXiv   pre-print
In this paper, we provide the monadic second-order theories of downward unbounded layered structures, which are infinitely refinable structures consisting of a coarsest domain and an infinite number of  ...  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,  ...  Moreover, the corresponding automata (Büchi sequence automata for the theory of finitelylayered structures, Rabin tree automata for downward unbounded structures, and systolic tree automata for upward  ... 
arXiv:cs/0311022v1 fatcat:xeaslhxh2bapti2u2uz6ofkjiq

Temporalized logics and automata for time granularity

MASSIMO FRANCESCHET, ANGELO MONTANARI
2004 Theory and Practice of Logic Programming  
In this paper, we provide the monadic second-order theories of downward unbounded layered structures, which are infinitely refinable structures consisting of a coarsest domain and an infinite number of  ...  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,  ...  Moreover, the corresponding automata (Büchi sequence automata for the theory of finitelylayered structures, Rabin tree automata for downward unbounded structures, and systolic tree automata for upward  ... 
doi:10.1017/s147106840400208x fatcat:gum2ttgmybgsjd2virziysrlru

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

E. Fachini, A. Maggiolo Schettini, G. Resta, D. Sangiorgi
1991 Theoretical Computer Science  
Sangiorgi, Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata, Theoretical Computer Science 83 (1991) 249-260. ' Present address: Dipartimento  ...  In this paper a contribution is given to the solution of the problem of finding an inductive characterization of the class of languages accepted by binary systolic tree automata, S(BSTA), in terms of the  ...  Introduction Systolic tree automata have been introduced by Culik II et al. in [4] as a tool to study power, limitations and properties of systolic systems in which the communication structure is a tree  ... 
doi:10.1016/0304-3975(91)90277-9 fatcat:4zcnnwfj4vbj5ncqdvhuovrw4a

A brief history of cellular automata

Palash Sarkar
2000 ACM Computing Surveys  
Cellular automata are simple models of computation which exhibit fascinatingly complex behavior.  ...  Here we trace a history of cellular automata from their beginnings with von Neumann to the present day.  ...  A related class of automata motivated by design of systolic systems and algorithms is the class of systolic trellis automata, which have been quite extensively studied by Choffrut and Culik II [1984]  ... 
doi:10.1145/349194.349202 fatcat:llv74746vnbwxcslsvadfiv4xi

A Logical Characterization of Systolic Languages [chapter]

Angelo Monti, Adriano Peron
1998 Lecture Notes in Computer Science  
In this paper we study, in the framework of mathematical logic, L(SBTA) i.e. the class of languages accepted by Systolic Binary Tree Automata.  ...  We also introduce a natural subclass of L(SBTA) which still properly contains the class of regular languages and which is proved to be characterized by Monadic Second Order logic over a nite signature  ...  The language fa 2 n b + : n 0g is denoted by ((( E b ) b) \ ^) ( E a ). The language of even length words is denoted by ( ? (a b)) (a b a b). Theorem 3.  ... 
doi:10.1007/bfb0028582 fatcat:be7ge5q64jcs5mypidnhvdtn2a

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

Angelo Monti, Adriano Peron
2000 Theoretical Computer Science  
-languages recognized by systolic (binary) tree automata is introduced. This class extends the class of B uchi !  ...  -languages is characterized in terms of a (suitable) concatenation of (ÿnitary) systolic tree languages.  ...  -languages recognized by systolic (resp.: by deterministic systolic) tree automata is denoted by L ! (SBTA) (resp.: L ! (DSBTA)).  ... 
doi:10.1016/s0304-3975(97)00257-0 fatcat:fhu6gq2idrbpniif6q57ge2v2a

Page 6653 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
(I-SLRN); Francese, Rita (I-SLRN); Napoli, Margerita (I-SLRN); Parente, Domenico (I-SLRN) BC-tree systolic automata: characterization and properties.  ...  He proves that realization by asynchronous automata is possible only for finite automata with memory depth equal to | which can be described by the functions y(t) = f(x(t), y(t—1)), y(t) = f(x(t), x(t-  ... 

Page 6995 of Mathematical Reviews Vol. , Issue 96k [page]

1996 Mathematical Reviews  
-tree systolic automata.  ...  Summary: “The computational power of systolic automata over so called Y-trees is investigated.  ... 

Broadcasting Automata and Patterns on Z^2 [article]

Thomas Nickson, Igor Potapov
2014 arXiv   pre-print
The waves generated by activating processes in a digital environment can be used for designing a vari- ety of wave algorithms.  ...  The Broadcasting Automata model draws inspiration from a variety of sources such as Ad-Hoc radio networks, cellular automata, neighbourhood se- quences and nature, employing many of the same pattern forming  ...  Whilst in general Broadcasting Automata may be used represent any of the common network topologies (such as, linear array, ring, star, tree, near-neighbour mesh, systolic array, completely connected, chordal  ... 
arXiv:1410.0573v1 fatcat:wtlwc3s4onaiti4jdjterip64m

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

1994 Mathematical Reviews  
(I-SLRN-I2; Baronissi) Languages accepted by systolic Y-tree automata: structural characterizations. (English summary) Acta Inform. 29 (1992), no. 8, 761-778. Following papers of Fachini et al.  ...  Y-tree, (e4) L is accepted by an NSYA over a quasiprefix Y-tree JT, which is not complete.  ... 

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.  ...  Two of the most powerful recent concepts in computer architecture, systolic systems by H. T. Kung and RISC architecture by J. Cocke, have quite similar genesis.  ...  It has been shown in [ 131 that families of languages accepted by systolic tree automata over balanced trees and by homogeneous ROTA are incomparable.  ... 
doi:10.1016/0304-3975(90)90190-s fatcat:sztlpeed4jhcdojkzi5z5zyska
« Previous Showing results 1 — 15 out of 115 results