Abstract
The relation between two basic types of systolic automata—tree automata and trellis automata—is investigated. First it is shown that for every natural t>1 there is a simple nonhomogeneous (actually regular and also modular) trellis [Formula: see text] such that any t-ary systolic tree automaton can be simulated in a universal and quite straighforward way on a trellis automaton over [Formula: see text]. This implies that the family of languages accepted by systolic tree automata, which is incomparable with the family of languages accepted by homogeneous systolic trellis automata, is actually contained in the family of languages accepted by trellis automata that are both regular and modular.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
