On the State Complexity of Combined Operations
From MaRDI portal
Recommendations
- State complexity of combined operations
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
- State complexity of two combined operations: catenation-union and catenation-intersection
- State complexity of two combined operations: catenation-star and catenation-reversal
- Estimation of state complexity of combined operations
Cited in
(22)- On the Hopcroft's minimization technique for DFA and DFCA
- State complexity of unique rational operations
- A general approach to state complexity of operations: formalization and limitations
- Estimation of state complexity of combined operations
- State complexity of combined operations
- Undecidability of state complexities using mirror images
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
- Hopcroft’s Minimization Technique: Queues or Stacks?
- State complexity of star of union and square of union on \textit{k} regular languages
- State complexity of combined operations with two basic operations
- A survey on operational state complexity
- scientific article; zbMATH DE number 2182451 (Why is no real title available?)
- State complexity and approximation
- Incomplete operational transition complexity of regular languages
- A combinatorial approach for the state complexity of the shuffle product
- Algebraic and combinatorial tools for state complexity: application to the star-xor problem
- Complexity of operation problems
- State complexity research and approximation
- State complexity of four combined operations composed of union, intersection, star and reversal
- Operational State Complexity under Parikh Equivalence
- The state complexity of \(L^{2}\) and \(L^k\)
- Boundary sets of regular and context-free languages
This page was built for publication: On the State Complexity of Combined Operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757237)
