State Complexity of Basic Operations on Suffix-Free Regular Languages
From MaRDI portal
Publication:3525596
Recommendations
- State complexity of basic operations on suffix-free regular languages
- State complexity of combined operations for suffix-free regular languages
- Nondeterministic state complexity for suffix-free regular languages
- Operational state complexity of prefix-free regular languages
- State Complexity of Combined Operations for Prefix-Free Regular Languages
Cited in
(18)- Kuratowski algebras generated by factor-, subword-, and suffix-free languages
- State complexity of combined operations for suffix-free regular languages
- Simple regular expressions and languages
- Estimation of state complexity of combined operations
- State complexity of single-word pattern matching in regular languages
- State complexity of prefix, suffix, bifix and infix operators on regular languages
- Complexity of suffix-free regular languages
- Complexity of suffix-free regular languages
- State Complexity of Combined Operations for Prefix-Free Regular Languages
- Nondeterministic state complexity for suffix-free regular languages
- scientific article; zbMATH DE number 2081044 (Why is no real title available?)
- State complexity of basic operations on non-returning regular languages
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- State complexity of basic operations on non-returning regular languages
- State complexity of basic operations on suffix-free regular languages
- State complexity of code operators
- The state complexities of some basic operations on regular languages
- Square on ideal, closed and free languages
This page was built for publication: State Complexity of Basic Operations on Suffix-Free Regular Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525596)
