Abstract

We investigate the state complexity of finite word and tree languages. In particular, (1) we establish the state complexity of word languages whose words have bounded length; (2) we improve the upper bound given in [6] for union and intersection of finite word languages; and (3) we present an upper bound for union and intersection of finite tree languages.

Full Text
Published version (Free)

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