Abstract
Three types of nite-state graph automata are compared over directed acyclic graphs (where vertices and edges are labelled). The automata are distinguished by the way how states are attached to an input graph (\vertexmarking, \edge-marking, and \1-sphere-marking). We note the equivalence of these models, relate them to logical denability notions, and show that deterministic versions are strictly weaker (thus correcting an error of [9]).
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 callMore From: Bulletin of the Belgian Mathematical Society - Simon Stevin
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
