DMCA
Equivalence of Deterministic and Nondeterministic Epsilon Automata
Cached
Download Links
by
Michał Trybulec
BibTeX
@MISC{Trybulec_equivalenceof,
author = {Michał Trybulec},
title = {Equivalence of Deterministic and Nondeterministic Epsilon Automata},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Summary. Based on concepts introduced in Preliminaries For simplicity, we adopt the following convention: x, y, X denote sets, E denotes a non empty set, e denotes an element of E, u, u 1 , v, v 1 , v 2 , w denote elements of E ω , F denotes a subset of E ω , i, k, l denote natural numbers, T denotes a non empty transition-system over F , and S, T denote subsets of T. One can prove the following propositions:
