The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(I-ROME2-EE; Rome); Maggiolo-Schettini, A. (I-PISA-IF; Pisa); Sangiorgi, D. (4-EDIN-C; Edinburgh) Classes of systolic Y-tree automata and a comparison with systolic trellis automata. ... We give also a simulation of SYTA on regular and modular systolic trellis automata, strengthening a previous result on simulation of systolic tree automata on systolic trellis automata.” 94f:68139 68Q70 ...
Math. 15 (1984), no. 3-4, 195-212; ibid. 16 (1984), no. 1, 3-22; MR 87b:68074ab] to describe the computational structures called systolic trellis automata; they also described the class of regu- lar trellises ... The generalization involves systems of algebraic equations of the form y; = p;(y;,---, yn), where the y; are variables and the p; are polynomials in these unknowns over an arbitrary semiring A with 0 and ...
A general mathematical model of VLSI circuits, binary tree automata and real-time trellis automata are adopted for the purpose of additional programs. ... .°°* Lan Srv Yun where y; = L;(f;y;,---,yi-1), and L; is a permissible information operation. Information N is called nonadaptive if y; = L;(f). ...
For example, we use the transformation technique to give a concise proof of a strengthened version of Leiserson's and Saxe's Retiming Lemma and Systolic Conversion Theorem. ... As a practical application we show the correctness of a simple algorithm for distributed sorting on a systolic ring. Many other examples are given. ... the leftmost and rightmost processors only. ...doi:10.1016/0304-3975(85)90091-x fatcat:miga4mm5z5dp5gm7wltdwqfjbm
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 ... -, 2771 with a bounded number of alternations. 3346 alternating two-way finite automata, 25 1 I tree automata, 825 alternating two-way pushdown tree automata, 825 alternation, 825, 840, 1790, 1802, 3417 ...doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm
KIM, Characterizations and computational complexity of systolic trellis automata IBARRA, O.H., B.S. LEININGER and S. MORAN, On the complexity of simple arithmetic expressions IBARRA, O.H., S. ... SALOMAA, On a family of L languages resulting from systolic tree automata CULIK II, K. and T. HARJU, Dominoes over a free monoid CULIK II, K. and J. KARHUMAKI, The equivalence II, K., H.A. ... return and dual return complexities WEDDE, H., An interative and starvation-free solution for a general class of distributed control problems based on interaction primitives WEDDE, H., see A. ...doi:10.1016/0304-3975(88)90002-3 fatcat:gasluptczbb6bfplioxrtdrlpy
Kim, Characterizations and computational complexity of systolic trellis automata 29 (l-2) (1984) 123-153 Ibarra, O.H., M.A. Palis and J.H. ... 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
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017
To support more precise and scalable analyses, this paper introduces linear conjunctive language (LCL) reachability, a new, expressive class of graph reachability. ... Given a graph with n nodes and m edges, we propose an O(mn) time approximation algorithm for solving all-pairs LCL-reachability, which is asymptotically better than known CFL-reachability algorithms. ... Informally, a trellis automaton simulates DSTM moves along the gray arrows shown in Figure 7 (b). ...doi:10.1145/3009837.3009848 fatcat:n2safdisxvab7incw3s6p4yfly
Foundations of Artificial Intelligence
of statements with the different temporal domains of a layered temporal model and of switching from one domain to a coarser/finer one. ... of a given situation with respect to different granularity layers. ... over Y -trees (resp. trellis) [Gruska, 1990] . ...doi:10.1016/s1574-6526(05)80005-7 fatcat:jgytu4xfljdfdoso56gucfk2ya
Comparisons among classes of Y-tree systolic automata. (see 91h:68011) Ferber, Reginald Iteration on sets of configurations. 91m:68134 Fokas, A.S. (with Papadopoulou, E. P.; Saridakis, Yiannis G.) ... , Robert) A characterization of constant-time cellular automata computation. 91m:68136 Korec, Ivan Semilinear real-time systolic trellis automata. 91a:68205 Kuz'muk, V. ...
68Q70 Droste, Manfred see Bracho, Felipe, 94k:68140 Fachini, Emanuela (with Maggiolo-Schettini, Andrea; Sangiorgi, Davide) Classes of systolic Y-tree automata and a comparison with systolic trellis automata ... Control of w-automata, Church’s problem, and the emptiness problem for tree w-automata. ...
Simulation of systolic tree automata on trellis automata. 92c:68139 — (with Monti, A.; Napoli, M.; Parente, D.) ... Systolic Y-tree automata: closure properties and decision problems. ...
(see 2002k:68008) Monti, Angelo (with Peron, Adriano) Logical definability of Y-tree and trellis systolic w- languages. ... in connection with logical questions [see also 68Q45, 68Q70, 68R15] Bloem, Roderick (with Engelfriet, Joost) A comparison of tree transductions defined by monadic second order logic and by attribute grammars ...
(Summary) 94k:68108 68Q45 (68Q70) — (with Maggiolo-Schettini, Andrea; Sangiorgi, Davide) Classes of systolic Y-tree automata and a comparison with systolic trellis automata. ... (see 94i1:65004) 65M55 (73D15, 73V20, 86-08, 86A15) Fachini, Emanuela (with Monti, Angelo) Regular sets, context-free languages and systolic Y-tree automata. ...
Systolic trellis automata: stability, decidability and complexity. 88m:68046 (with Yu, Sheng) Real-time, pseudo real-time, and linear-time ITA. 88e:68087 Falk, H. ... Linearization and synthesis of cellular automata: the additive case. 88a:68078 Cloney, Thomas (with Goles Ch., Eric; Vichniac, G. Y.) ...
« Previous Showing results 1 — 15 out of 20 results