Abstract
The paper studies classes of regular languages based on algebraic constraints imposed on transitions of automata and discusses issues related to specifications of these classes from algebraic, computational and logical points of view.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have