A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
Within a lattice approach, the purpose of this paper is to give general necessary and sufficient conditions for internal stabilizability and for the existence of (weakly) left-/rig...
Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in ter...
An approach for constrained predictive control of linear systems (or uncertain systems described by polytopic uncertainty models) is presented. The approach consists of (in genera...
In an evolving community consisting of many individuals, it is often the case that the individuals tend, over time, to become more specialized in performing the tasks necessary fo...