Abstract
Finite automata that traverse graphs by moving along their edges are known as graph-walking automata (GWA). This paper investigates the state complexity of Boolean operations for this model. It is proved that the union of GWA with [Formula: see text] and [Formula: see text] states, with [Formula: see text], operating on graphs with [Formula: see text] labels of edge end-points, is representable by a GWA with [Formula: see text] states, and at least [Formula: see text] states are necessary in the worst case. For the intersection, the upper bound is [Formula: see text] and the lower bound is [Formula: see text]. The upper bound for the complementation is [Formula: see text], and the lower bound is [Formula: see text].
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 callMore From: International Journal of Foundations of Computer Science
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.
