Finite Automata Encoding Functions

04/07/2021
by   Dmitry Berdinsky, et al.
0

Finite automata are used to describe functions, geometric figures, fractals and as a tool for image compression. We introduce a new family of functions f: ℝ^d →ℝ encoded as finite automata by utilizing hierarchical tensor product B-splines and the theory of FA-presentable structures. We show that some problems which appear in the framework of hierarchical tensor product B-splines can be efficiently solved using the introduced encoding.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2018

Higher-Dimensional Timed Automata

We introduce a new formalism of higher-dimensional timed automata, based...
research
08/03/2021

Featured Team Automata

We propose featured team automata to support variability in the developm...
research
05/09/2022

Energy Büchi Problems

We show how to efficiently solve energy Büchi problems in finite weighte...
research
01/23/2018

Higher-dimensional automata modeling shared-variable systems

The purpose of this paper is to provide a construction to model shared-v...
research
06/03/2019

Separation and Renaming in Nominal Sets

Nominal sets provide a foundation for reasoning about names. They are us...
research
12/17/2022

Automata and automatic sequences

In the following pages we discuss infinite sequences defined on a finite...
research
09/26/2017

Tensor Product Generation Networks for Deep NLP Modeling

We present a new approach to the design of deep networks for natural lan...

Please sign up or login with your details

Forgot password? Click here to reset