Abstract
This paper is dedicated to studying model-theoretic and complexity properties of the theory of regular languages with the Kleene star operation. We construct a ‘‘natural’’ infinite set of axioms for this theory, and we prove that it is not finitely axiomatizable. We establish that this theory is countably categorical, but it is not categorical in any uncountable cardinality. Also, we find the exact amount of non-isomorphic models of given cardinality. Finally, we prove that the theory of regular languages with the Kleene star is PSPACE-complete.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
