Finite Automata Computing Real Functions
From MaRDI portal
Publication:4305358
DOI10.1137/S0097539791224893zbMath0820.68061OpenAlexW2041371169MaRDI QIDQ4305358
Juhani Karhumäki, Karel II Culik
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
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)
Related Items (30)
On the power of L-systems in image generation ⋮ Weighted automata and weighted logics with discounting ⋮ Pattern-matching problems for 2-dimensional images described by finite automata ⋮ Weighted automata and weighted logics on infinite words ⋮ Probabilistic Weighted Automata ⋮ Infinite fuzzy computations ⋮ Iterative weighted finite transductions ⋮ Skew and infinitary formal power series ⋮ Digital Image Compression ⋮ Function transformations with automata ⋮ On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages ⋮ Temporal Specifications with Accumulative Values ⋮ On computational power of weighted finite automata ⋮ Weighted Automata and Weighted Logics with Discounting ⋮ On continuous weighted finite automata ⋮ Binary operations on automatic functions ⋮ Quantitative vs. weighted automata ⋮ On Generalizations of Weighted Finite Automata and Graphics Applications ⋮ On continuous functions computed by finite automata ⋮ Ancient Typefaces and Parametric Weighted Finite Automata ⋮ Finite state transformations of images ⋮ Image Representation using Distributed Weighted Finite Automata ⋮ Weighted path queries on semistructured databases ⋮ Weighted finite transducers in image processing ⋮ DECISION PROBLEMS ON PATH-CONTROLLED GRAMMARS ⋮ STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA ⋮ Weighted automata ⋮ A method of specification of fractal sets ⋮ Trace semantics via determinization ⋮ The complexity of compressing subsegments of images described by finite automata
This page was built for publication: Finite Automata Computing Real Functions
