Finite Automata Computing Real Functions

DOI10.1137/S0097539791224893MaRDI QIDQ4305358zbMATH OpenOpenAlexFDO

Authors Karel II Culik, Juhani Karhumäki

Publication date 17 October 1994

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539791224893

zbMATH Keywords

finite automataautomata representation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Fractals (28A80)

Recommendations

• Real functions computable by finite automata using affine representations.
• On continuous functions computed by finite automata
• Algorithmic questions for real functions
• Publication:4939597

Cited in

(49)

• Weighted automata and weighted logics on infinite words
• scientific article; zbMATH DE number 1400044 (Why is no real title available?)
• Smooth finitely computable functions are affine, or why quantum systems cause waves
• Algorithmic questions for real functions
• The complexity of compressing subsegments of images described by finite automata
• Skew and infinitary formal power series
• Probabilistic Weighted Automata
• Chomskian hierarchies of families of sets of piecewise continuous functions
• Weighted finite transducers in image processing
• Weighted finite automata: Computing with different topologies
• Weighted automata and weighted logics with discounting
• scientific article; zbMATH DE number 919600 (Why is no real title available?)
• Temporal specifications with accumulative values
• On computational power of weighted finite automata
• Real functions computable by finite automata using affine representations.
• Approximation of continuous functions by finite automata
• Ancient Typefaces and Parametric Weighted Finite Automata
• scientific article; zbMATH DE number 468642 (Why is no real title available?)
• Decision problems on path-controlled grammars
• Binary operations on automatic functions
• Finite automata and numbers
• State complexity of additive weighted finite automata
• Developments in Language Theory
• A method of specification of fractal sets
• Digital image compression
• Infinite fuzzy computations
• FINDING THE SIGN OF A FUNCTION VALUE BY BINARY CELLULAR AUTOMATON
• Automata over continuous time
• Weighted path queries on semistructured databases
• Image representation using distributed weighted finite automata
• Iterative weighted finite transductions
• On the power of L-systems in image generation
• On continuous functions computed by finite automata
• Weighted Automata and Weighted Logics with Discounting
• Weighted automata
• Description of Generalized Continued Fractions by Finite Automata
• On the determinization blowup for finite automata recognizing equal-length languages
• On finite-time computability preserving conversions
• Trace semantics via determinization
• Observations on the smoothness properties of real functions computed by weighted finite automata
• Pattern-matching problems for 2-dimensional images described by finite automata
• On continuous weighted finite automata
• Quantitative vs. weighted automata
• On the effectiveness of cellular automata to add real numbers
• Real functions incrementally computable by finite automata
• Function transformations with automata
• \(R^*\)-transformers and fractal curves
• On Generalizations of Weighted Finite Automata and Graphics Applications
• Finite state transformations of images

This page was built for publication: Finite Automata Computing Real Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305358)