Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language
From MaRDI portal
Publication:5250874
DOI10.14232/actacyb.21.4.2014.1zbMath1324.68055OpenAlexW136331652MaRDI QIDQ5250874
No author found.
Publication date: 22 May 2015
Published in: Acta Cybernetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.14232/actacyb.21.4.2014.1
regular languagefinite automatonstate complexitybifix-freefactor-freetight upper boundquotient complexitysubword-free
Related Items (12)
The cut operation in subclasses of convex languages (extended abstract) ⋮ Nondeterministic complexity of operations on free and convex languages ⋮ Complexity of suffix-free regular languages ⋮ Complexity of Suffix-Free Regular Languages ⋮ The cut operation in subclasses of convex languages ⋮ Operational complexity in subregular classes ⋮ Power, positive closure, and quotients on convex languages ⋮ Nondeterministic State Complexity of Star-Free Languages ⋮ Complexity of bifix-free regular languages ⋮ Complexity of bifix-free regular languages ⋮ Nondeterministic complexity in subclasses of convex languages ⋮ Closure properties of subregular languages under operations
This page was built for publication: Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language
