期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2019
卷号：305
页码：154-168
DOI：10.4204/EPTCS.305.11
语种：English
出版社：Open Publishing Association
摘要：We investigate the state complexity of the star of symmetrical differences using modifiers and monsters. A monster is an automaton in which every function from states to states is represented by at least one letter. A modifier is a set of functions allowing one to transform a set of automata into one automaton. These recent theoretical concepts allow one to find easily the desired state complexity. We then exhibit a witness with a constant size alphabet.
