Random Words in a (Weighted) Regular Language: a Free Energy Approach
Formal Languages and Automata Theory
2017-11-27 v1
Abstract
We study random words in a weighted regular language that achieve the maximal free energy using thermodynamics formalism. In particular, typical words in the language are algorithmically generated which have applications in computer security (anomaly detection) and software enegineering (test case generation).
Keywords
Cite
@article{arxiv.1711.08963,
title = {Random Words in a (Weighted) Regular Language: a Free Energy Approach},
author = {Cewei Cui and Zhe Dang},
journal= {arXiv preprint arXiv:1711.08963},
year = {2017}
}