scientific article
From MaRDI portal
Publication:3687724
zbMath0571.68043MaRDI QIDQ3687724
Karel II Culik, Arto Salomaa, Derick Wood
Publication date: 1984
Full work available at URL: https://eudml.org/doc/92200
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (20)
A Kleene-like characterization of languages accepted by systolic tree automata ⋮ Syntactic monoids in the construction of systolic tree automata ⋮ Effective systolic algorithms for gossiping in cycles and two-dimensional grids ⋮ C-tree systolic automata ⋮ Power of interconnections and of nondeterminism in regularY-tree systolic automata ⋮ Systolic Automata and P Systems ⋮ State complexity of SBTA languages ⋮ Succinctness of descriptions of SBTA-languages ⋮ Tissue P systems. ⋮ Synthesis, structure and power of systolic computations ⋮ Systolic automata for VLSI on balanced trees ⋮ The complexity of systolic dissemination of information in interconnection networks ⋮ Completeness results concerning systolic tree automata and E0L languages ⋮ Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata ⋮ Systolic tree \(\omega\)-languages: The operational and the logical view ⋮ A characterization of systolic binary tree automata and applications ⋮ Iterative tree automata ⋮ Topological transformations as a tool in the design of systolic networks ⋮ Languages accepted by systolic \(Y\)-tree automata: Structural characterizations ⋮ Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
Cites Work
This page was built for publication:
