2018/06/08 by Justin DeBenedetto, David Chiang, DeBenedetto, Justin +1
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Machine Learning and Algorithms #Network Packet Processing and Optimization #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1806.03315
openalex publication_date 2018/06/08 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28
Multiset automata are a class of automata for which the symbols can be read\nin any order and obtain the same result. We investigate weighted multiset\nautomata and show how to construct them from weighted regular expressions. We\npresent training methods to learn the weights for weighted regular expressions\nand for general multiset automata from data. Finally, we examine situations in\nwhich inside weights can be computed more efficiently.\n