Pages that link to "Item:Q3004607"
From MaRDI portal
The following pages link to Undecidability of the State Complexity of Composed Regular Operations (Q3004607):
Displayed 8 items.
- State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- State complexity of combined operations with two basic operations (Q441851) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
- Undecidability of State Complexities Using Mirror Images (Q3166954) (← links)