On a family of L languages resulting from systolic tree automata
From MaRDI portal
(Redirected from Publication:800102)
Recommendations
Cites work
- scientific article; zbMATH DE number 3485222 (Why is no real title available?)
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- On some families of languages related to developmental systems
- Systolic automata for VLSI on balanced trees
- Systolic trellis automatat†
Cited in
(18)- Synthesis, structure and power of systolic computations
- A characterization of systolic binary tree automata and applications
- Succinctness of descriptions of SBTA-languages
- A Kleene-like characterization of languages accepted by systolic tree automata
- Systolic automata and P systems
- Syntactic monoids in the construction of systolic tree automata
- Power of interconnections and of nondeterminism in regularY-tree systolic automata
- Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
- A systolic array for the longest common subsequence problem
- A note on emptiness for alternating finite automata with a one-letter alphabet
- scientific article; zbMATH DE number 4057034 (Why is no real title available?)
- Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
- Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
- On Families of Full Trios Containing Counter Machine Languages
- Systolic tree ω-languages
- C-tree systolic automata
- Systolic trees and systolic language recognition by tree automata
- Completeness results concerning systolic tree automata and E0L languages
This page was built for publication: On a family of L languages resulting from systolic tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800102)
