scientific article; zbMATH DE number 3911718
From MaRDI portal
Publication:3687724
zbMATH Open0571.68043MaRDI QIDQ3687724FDOQ3687724
Authors: Karel II Culik, Arto Salomaa, D. Wood 
Publication date: 1984
Full work available at URL: https://eudml.org/doc/92200
Title of this publication is not available (Why is that?)
Recommendations
Cites Work
Cited In (26)
- On a family of L languages resulting from systolic tree automata
- Synthesis, structure and power of systolic computations
- Systolic trellis automatat†
- Succinctness of descriptions of SBTA-languages
- State complexity of SBTA languages
- A characterization of systolic binary tree automata and applications
- Systolic automata for VLSI on balanced trees
- A Kleene-like characterization of languages accepted by systolic tree automata
- Title not available (Why is that?)
- SYSTOLIC TREE WITH BASE AUTOMATA
- Power of interconnections and of nondeterminism in regularY-tree systolic automata
- Syntactic monoids in the construction of systolic tree automata
- Tissue P systems.
- Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
- Systolic Automata and P Systems
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids
- A systolic design for acceptors of regular languages
- Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
- Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
- Systolic tree \(\omega\)-languages: The operational and the logical view
- Bottom-up tree acceptors
- The complexity of systolic dissemination of information in interconnection networks
- C-tree systolic automata
- Iterative tree automata
- Topological transformations as a tool in the design of systolic networks
- Completeness results concerning systolic tree automata and E0L languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3687724)
