On a family of L languages resulting from systolic tree automata

DOI10.1016/0304-3975(83)90032-4zbMATH Open0549.68081OpenAlexW2081564114MaRDI QIDQ800102FDOQ800102

Authors: Karel II Culik, Jozef Gruska, Arto Salomaa 

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90032-4

Recommendations

• scientific article; zbMATH DE number 3911718
• C-tree systolic automata
• scientific article; zbMATH DE number 4057034
• Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
• Systolic tree ω-languages

zbMATH Keywords

formal power seriesemptiness problemBT-VLSI languagesEOL languagesystolic tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Systolic trellis automatat†
• Systolic automata for VLSI on balanced trees
• On some families of languages related to developmental systems
• Title not available (Why is that?)

Cited In (18)

• Synthesis, structure and power of systolic computations
• Succinctness of descriptions of SBTA-languages
• A characterization of systolic binary tree automata and applications
• A Kleene-like characterization of languages accepted by systolic tree automata
• Systolic automata and P systems
• Power of interconnections and of nondeterminism in regularY-tree systolic automata
• Syntactic monoids in the construction of systolic tree 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
• Title not available (Why is that?)
• 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)