A note on Incomplete Generating Languages
Martin Juráš · International journal of mathematics and computation · 2013
Incomplete generating languages form a subclass of 1-regular languages. These languages represent a non-deterministic output of a computer with finite operational memory, where the decisions are made by observing k previous states. We provide a new characterization of these languages, study their algebraic structure respect to boolean operations and examine their poset structure with respect to set inclusion.