Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

102

Voted

LATIN
2000
Springer

71views Information Technology» more LATIN 2000»

Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract

15 years 6 months ago

Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract

Download www.cs.stevens.edu

Stephen L. Bloom, Zoltán Ésik

Real-time Traffic

Information Management | LATIN 2000 |

claim paper

Related Content

» A Sound and Complete Calculus for Finite Stream Circuits

» Combinatorics and Geometry of Finite and Infinite Squaregraphs

» Synchronization of Grammars

» Complete Axiomatizations of Finite Syntactic Epistemic States

» Cut elimination and strong separation for substructural logics An algebraic approach

» Efficient Factorisation Algorithm for List Decoding AlgebraicGeometric and ReedSolomon Cod...

» Parallel Sparse Matrix Computations Using the PINEAPL Library A Performance Study

» Registration of 3D Points Using Geometric Algebra and Tensor Voting

» Algebraic Techniques for Timed Systems

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	LATIN
Authors	Stephen L. Bloom, Zoltán Ésik

Comments (0)