4666 search results - page 158 / 934 » Equations on Timed Languages |
169
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
171
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— Bilateral Control by States Convergence is a novel and little exploited control strategy that has been successfully applied to the teleoperation of robotic manipulators using S...
152
click to vote
ICGI
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. The present paper presents a new approach of how to convert Gold-style [4] learning in the limit into stochastically finite learning with high confidence. We illustrate t...
143
click to vote
CAI
2009
Springer
16 years 2 days ago
2009
Springer
The aim of this paper is to collect definitions and results on the main classes of 2D languages introduced with the attempt of generalizing regular and context-free string languag...
122
click to vote
IPL
2008
15 years 5 months ago
2008
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...