![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Abstract
This paper presents conditions under which the union of a finite number of certain bounded deterministic languages is also deterministic. The languages under consideration are defined by conditions on the generators of linear sets. Similarly, the conditions given for the union to be deterministic are conditions among generators for several linear sets. We establish the result by demonstrating how several deterministic pushdown automata may be merged into one when our conditions are satisfied.