A connection between concurrency and language theory
Logic in Computer Science
2013-04-16 v3 Formal Languages and Automata Theory
Abstract
We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and simulation equivalence classes of (regular) synchronization trees (or processes). The results reveal a close relationship between classical language theory and process algebra.
Cite
@article{arxiv.1303.0044,
title = {A connection between concurrency and language theory},
author = {Zoltan Esik},
journal= {arXiv preprint arXiv:1303.0044},
year = {2013}
}