The complexity of compressing subsegments of images described by finite automata
Discrete Applied Mathematics
Pattern-matching problems for two-dimensional images described by finite automata
Nordic Journal of Computing
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Applications of Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Similarity Enrichment in Image Compression through Weighted Finite Automata
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
String Transformation for n -Dimensional Image Compression
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
The Compression of Subsegments of Images Described by Finite Automata
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Weighted finite automata and metrics in cantor space
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Finite state methods for compression and manipulation of images
DCC '95 Proceedings of the Conference on Data Compression
Weighted path queries on semistructured databases
Information and Computation
Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Skew and infinitary formal power series
Theoretical Computer Science
A method of specification of fractal sets
Cybernetics and Systems Analysis
Probabilistic Weighted Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Fuzzy Sets and Systems
Weighted path queries on semistructured databases
Information and Computation
Skew and infinitary formal power series
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Weighted automata and weighted logics with discounting
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
On generalizations of weighted finite automata and graphics applications
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
ACM Transactions on Computational Logic (TOCL)
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
On computability and some decision problems of parametric weighted finite automata
Journal of Automata, Languages and Combinatorics
Ancient typefaces and parametric weighted finite automata
Rainbow of computer science
Weighted finite automata: computing with different topologies
UC'11 Proceedings of the 10th international conference on Unconventional computation
Refinement of near random access video coding with weighted finite automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Parametric weighted finite automata for figure drawing
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
ON COMPUTATIONAL POWER OF WEIGHTED FINITE AUTOMATA
Fundamenta Informaticae
| Hi-index | 0.00 |
A new application of finite automata as computers of real functions is introduced. It is shown that even automata with a restricted structure compute all polynomials, many fractal-like and other functions. Among the results shown, the authors give necessary and sufficient conditions for continuity, show that continuity and equivalence are decidable properties, and show how to compute integrals of functions in the automata representation.