Sequence Sentential Decision Diagrams
In this paper, we propose a new data structure sequence sentential decision diagram (SSDD) that represents sets of strings. SSDD is a generalized data structure of Sequence Binary Decision Diagram (SeqBDD), that is a similar data structure to a deterministic finite automaton, but the size can be exponentially smaller than the SeqBDD for the same string set. We also provide algorithms to manipulate sets of strings on SSDD. These algorithms allow operations such as intersection, union, and concatenation to be executed on SSDDs under their compressed representations without expanding. We analyzed the size complexity of SSDD and the time complexity of proposed algorithms.
KeywordsData structure Compression Decision diagram Set of strings
- 4.Darwiche, A.: SDD: a new canonical representation of propositional knowledge bases. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI 2011, vol. 22, pp. 819–826. AAAI Press (2011)Google Scholar
- 9.Minato, S.-I.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 1058–1066 (2016)Google Scholar
- 10.Minato, S.-I., Ishiura, N., Yajima, S.: Shared binary decision diagram with attributed edges for efficient Boolean function manipulation. In: Proceedings of the 27th ACM/IEEE Design Automation Conference, pp. 52–57 (1990)Google Scholar
- 11.Nishino, M., Yasuda, N., Minato, S.-I., Nagata, M.: Zero-suppressed sentential decision diagrams. In: Proceedings of the 30th ACM/IEEE Design Automation Conference, pp. 272–277 (2016)Google Scholar