Title: Theory / Unimportant / CS / Fundamental / Automata / Finite / Pin{ / D Advanced tools= / 17 Unambiguous star-free languages+32
Tags: hasSeenConjDef

Name: The set of unambiguous star-free language of \(A^*\)
Definition: containing the languages \(B^*\) for \(B\subseteq A\)
Page: 241
Chapter: XIV
Section: 1
Variables: \(A\) an alphabet
Kind: Prop
Definition2: closed under finite union
Example: Finite language
Conjdef: The least set
Definition3: closed under unambiguous marked product