Pages that link to "Item:Q3503086"
From MaRDI portal
The following pages link to ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION (Q3503086):
Displayed 15 items.
- State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
- State complexity of inversion operations (Q896671) (← links)
- State complexity of basic language operations combined with reversal (Q948089) (← links)
- State complexity of power (Q1019718) (← links)
- Estimation of state complexity of combined operations (Q2271462) (← links)
- Composition and orbits of language operations: finiteness and upper bounds (Q2855749) (← links)
- Undecidability of state complexity (Q2855756) (← links)
- State Complexity of Regular Tree Languages for Tree Matching (Q2974061) (← links)
- Undecidability of State Complexities Using Mirror Images (Q3166954) (← links)
- State Complexity of Boundary of Prefix-Free Regular Languages (Q3455750) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)
- STATE COMPLEXITY AND APPROXIMATION (Q4902894) (← links)
- State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
- Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309) (← links)