Palindrome complexity
- 作者Jean-Paul Allouche; Michael Baake; Julien Cassaigne; David Damanik
- 卷第292卷
- 期第1期
- 印刷ISSN0304-3975
- 文件大小193.17KB
- 发表时间2003
- DOI10.1016/s0304-3975(01)00212-2
- 页码9-31
同作者推荐
The probability nesting gameDanièle Beauquier; Yoram Hirshfeld; Alexander Rabinovich; Anatol Slissenko · 2002
Polytime model checking for timed probabilistic computation tree logicDanièle Beauquier; Anatol Slissenko · 1998
A first order logic for specification of timed algorithms: basic properties and a decidable classDanièle Beauquier; Anatol Slissenko · 2001