A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is an NFA isomorphic to $N$. Moreover, we provide a concise axiomatization of language equivalence: two NFAs $N_1$ and $N_2$ recognize the same language if and only if the associated terms $p_1$ and $p_2$, respectively, can be equated by means of a set of axioms, comprising 7 axioms plus 3 conditional axioms, only.

翻译：提出了一种进程代数，其语义将项映射为非确定性有限自动机（简称NFA）。我们证明了一个可表示性定理：对于每个NFA $N$，存在一个进程代数项 $p$，使得其语义是一个同构于 $N$ 的NFA。此外，我们给出了语言等价性的一种简洁公理化：两个NFA $N_1$ 和 $N_2$ 识别相同语言当且仅当它们对应的项 $p_1$ 和 $p_2$ 可以通过一组仅包含7条公理加3条条件公理的公理系统相等。