The following pages link to STACS 2005 (Q5710708):
Displaying 12 items.
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- Roulette games and depths of words over finite commutative rings (Q831155) (← links)
- Language equations with complementation: decision problems (Q880178) (← links)
- Well quasi-orders generated by a word-shuffle rewriting (Q884464) (← links)
- Playing with Conway's problem (Q2378537) (← links)
- Commutation with codes (Q2484442) (← links)
- Computing by commuting. (Q2490820) (← links)
- Regular solutions of language inequalities and well quasi-orders (Q2581271) (← links)
- The power of commuting with finite sets of words (Q2643146) (← links)
- On the simplest centralizer of a language (Q3431440) (← links)
- Well Quasi-orders in Formal Language Theory (Q3533001) (← links)
- Machines, Computations, and Universality (Q5710891) (← links)