Now showing items 1-3 of 3

    • Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Language 

      Brzozowski, Janusz; Jirásková, Galina; Baiyu, Li; Smith, Joshua (Institute of Informatics: University of Szeged, 2014)
      A language $L$ is prefix-free if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix-, factor-, and subword-free languages are defined similarly, where by ``subword" we mean ``subsequence", ...
    • Quotient Complexity Of Closed Languages 

      Brzozowski, Janusz; Jirásková, Galina; Zou, Chenglong (Springer, 2014-02-01)
      A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and subword-closed languages in an analogous way, where by factor we mean contiguous subsequence, ...
    • Quotient Complexity of Ideal Languages 

      Brzozowski, Janusz; Jirásková, Galina; Li, Baiyu (Elsevier, 2013-01-28)
      A language L over an alphabet Σ is a right (left) ideal if it satisfies L=LΣ∗ (L=Σ∗L). It is a two-sided ideal if L=Σ∗LΣ∗, and an all-sided ideal if L=Σ∗L, the shuffle of Σ∗ with L. Ideal languages are not only of interest ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages