The following pages link to Michal Hospodár (Q1616973):
Displaying 18 items.
- The ranges of accepting state complexities of languages resulting from some operations (Q1616974) (← links)
- Operations on Boolean and alternating finite automata (Q1625163) (← links)
- Power, positive closure, and quotients on convex languages (Q2029485) (← links)
- Operations on subregular languages and nondeterministic state complexity (Q2112186) (← links)
- The cut operation in subclasses of convex languages (extended abstract) (Q2164745) (← links)
- Descriptional complexity of power and positive closure on convex languages (Q2177606) (← links)
- Square, power, positive closure, and complementation on star-free languages (Q2179330) (← links)
- The range of state complexities of languages resulting from the cut operation (Q2278275) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Nondeterministic complexity of operations on free and convex languages (Q2399254) (← links)
- On the descriptive complexity of \(\overline{\varSigma ^*\overline{L}}\) (Q2408805) (← links)
- Nondeterministic Complexity of Operations on Closed and Ideal Languages (Q2830213) (← links)
- Operations on Permutation Automata (Q5041254) (← links)
- The complexity of concatenation on deterministic and alternating finite automata (Q5223613) (← links)
- Descriptional Complexity of the Forever Operator (Q5384434) (← links)
- The Ranges of Accepting State Complexities of Languages Resulting from Some Operations (Q5859667) (← links)
- Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
- The cut operation in subclasses of convex languages (Q6165559) (← links)
