The following pages link to Christian Rauch (Q832941):
Displaying 10 items.
- The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract) (Q832942) (← links)
- More on the descriptional complexity of products of finite automata (Q2096585) (← links)
- On the descriptional complexity of the direct product of finite automata (Q2112184) (← links)
- On the computational complexity of reaction systems, revisited (Q2117085) (← links)
- The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract) (Q2117666) (← links)
- On 25 years of CIAA through the lens of data science (Q2164730) (← links)
- The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case (Q6070753) (← links)
- On the accepting state complexity of operations on permutation automata (Q6186540) (← links)
- On Minimal Pumping Constants for Regular Languages (Q6204130) (← links)
- On pumping preserving homomorphisms and the complexity of the pumping problem (extended abstract) (Q6666794) (← links)
