Automata, Power Series, and Coinduction: taking input derivatives seriously (Extended Abstract) (1999)

Cached

Download Links

by J. J. M. M. Rutten
Citations:6 - 1 self

Documents Related by Co-Citation

19 Calculus in Coinductive Form – D. Pavlovic, M.H. Escardó - 1998
2 Denotational testing semantics in coinductive form – Michele Boreale, Fabio Gadducci - 2003
3200 Communication and Concurrency – R Milner - 1989
23 Tropical Semirings – Jean-Eric Pin
67 On relations defined by generalized finite automata – C Elgot, F Mezei - 1965
50 Behavioural Differential Equations: A Coinductive Calculus of Streams, Automata, and Power Series – J. J. M. M. Rutten - 2000
1 Bypasses: a Simple Approach to Complexity – Z A Melzak - 1983
1 Report on the Programming Language Haskell. Available from http://www.haskell.org – J Peterson, K Hammond - 1997
3 Functional pearl: Power series, power serious – M D McIlroy - 1999
9 Generating Power of Lazy Semantics – Jerzy Karczmarczuk - 1997
31 Exponential numbers – E T Bell - 1934
104 A Practical Theory of Programming – E C R Hehner - 1993
42 Exact real arithmetic: A case study in higher order programming – H-J Boehm, R Cartwright, M Riggle, M O’Donnell - 1986
2 THE ADDITIVE GROUP OF THE RATIONALS DOES NOT HAVE AN AUTOMATIC PRESENTATION – Todor Tsankov - 905
1 functions computable by finite automata using affine representations,” Theor – M Konecn´y, “Real - 2002
1 How to decide continuity of rational functions on infinite words,” Theor – C Prieur - 2002
1 On the continuity set of an omega rational function – O Carton, O Finkel, P Simonnet - 2008
1 The Field of Reals is not omega-Automatic – F Abu Zaid, E Grädel, Ł Kaiser - 2012
16 Some characterizations of functions computable in on-line arithmetic – Jean-michel Muller - 1994