The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Exact real arithmetic: a case study in higher order programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Computable analysis: an introduction
Computable analysis: an introduction
How to decide continuity of rational functions on infinite words
Theoretical Computer Science
Real functions computable by finite automata using affine representations
Theoretical Computer Science
Some Characterizations of Functions Computable in On-Line Arithmetic
IEEE Transactions on Computers
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Semantics of Exact Real Arithmetic
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automatic Structures: Richness and Limitations
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
On relations defined by generalized finite automata
IBM Journal of Research and Development
Continuity analysis of programs
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
Continuity and robustness of programs
Communications of the ACM
| Hi-index | 0.00 |
We initiate the study of regular real analysis, or the analysis of real functions that can be encoded by automata on infinite words. It is known that ω-automata can be used to represent {relations} between real vectors, reals being represented in exact precision as infinite streams. The regular functions studied here constitute the functional subset of such relations. We show that some classic questions in function analysis can become elegantly computable in the context of regular real analysis. Specifically, we present an automata-theoretic technique for reasoning about limit behaviors of regular functions, and obtain, using this method, a decision procedure to verify the continuity of a regular function. Several other decision procedures for regular functions-for finding roots, fix points, minima, etc.-are also presented. At the same time, we show that the class of regular functions is quite rich, and includes functions that are highly challenging to encode using traditional symbolic notation.