Pages that link to "Item:Q1163370"
From MaRDI portal
The following pages link to Efficient recognition of rational relations (Q1163370):
Displaying 10 items.
- On efficient recognition of transductions and relations (Q1066679) (← links)
- Rational equivalence relations (Q1089801) (← links)
- Parallel parsing on a one-way linear array of finite-state machines (Q1183569) (← links)
- On the parallel complexity of loops (Q1391751) (← links)
- Algorithmic and algebraic aspects of unshuffling permutations (Q1749534) (← links)
- Recognizing binary shuffle squares is \textsf{NP}-hard (Q2285126) (← links)
- Quasi-automatic semigroups (Q2422022) (← links)
- On recognising words that are squares for the shuffle product (Q2699216) (← links)
- The Shuffle Product: New Research Directions (Q2799163) (← links)
- A constant time string shuffle algorithm on reconfigurable meshes (Q3838260) (← links)
