Nondeterministic state complexity for suffix-free regular languages
From MaRDI portal
Recommendations
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- State Complexity of Basic Operations on Suffix-Free Regular Languages
- State complexity of basic operations on suffix-free regular languages
- Nondeterministic complexity of operations on free and convex languages
- State complexity of combined operations for suffix-free regular languages
Cited in
(25)- State complexity of combined operations for suffix-free regular languages
- State Complexity of Basic Operations on Suffix-Free Regular Languages
- Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\).
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- scientific article; zbMATH DE number 176770 (Why is no real title available?)
- Operations on subregular languages and nondeterministic state complexity
- On a Maximal NFA Without Mergible States
- State complexity of basic operations on suffix-free regular languages
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
- Nondeterministic state complexity of star-free languages
- Complement on prefix-free, suffix-free, and non-returning NFA languages
- Complement on free and ideal languages
- Nondeterministic state complexity of star-free languages
- Power, positive closure, and quotients on convex languages
- Run-Length Encoded Nondeterministic KMP and Suffix Automata
- Nondeterministic state complexity of proportional removals
- Nondeterministic complexity of operations on free and convex languages
- Nondeterministic complexity in subclasses of convex languages
- Nondeterministic operational complexity in subregular languages
- Square, power, positive closure, and complementation on star-free languages
- scientific article; zbMATH DE number 5309908 (Why is no real title available?)
- State complexity of unambiguous operations on finite automata
- The nondeterministic state complexity of the site-directed deletion language operation
- Nondeterministic complexity of operations on closed and ideal languages
- Nondeterministic state complexity of proportional removals
This page was built for publication: Nondeterministic state complexity for suffix-free regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964025)
