English
Related papers

Related papers: Weighted Automata and Regular Expressions for Fina…

200 papers

In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata by A.Kondacs and J.Watrous. The well-formedness conditions for…

Quantum Physics · Physics 2007-05-23 Maksim Kravtsev

Financial datasets often suffer from bias that can lead to unfair decision-making in automated systems. In this work, we propose FairFinGAN, a WGAN-based framework designed to generate synthetic financial data while mitigating bias with…

Machine Learning · Computer Science 2026-03-06 Tai Le Quy , Dung Nguyen Tuan , Trung Nguyen Thanh , Duy Tran Cong , Huyen Giang Thi Thu , Frank Hopfgartner

This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating…

Logic in Computer Science · Computer Science 2024-02-14 Gustav Grabolle

Stochastic volatility models based on Gaussian processes, like fractional Brownian motion, are able to reproduce important stylized facts of financial markets such as rich autocorrelation structures, persistence and roughness of sample…

Probability · Mathematics 2022-05-10 Eduardo Abi Jaber

The weight maximization problem (WMP) is the problem of finding the word of highest weight on a weighted finite state automaton (WFA). It is an essential question that emerges in many optimization problems in automata theory. Unfortunately,…

Neural and Evolutionary Computing · Computer Science 2020-04-15 Elena Gutiérrez , Takamasa Okudono , Masaki Waga , Ichiro Hasuo

We examine whether and how granular, real-time predictive models should be integrated into central banks' macroprudential toolkit. First, we develop a tractable framework that formalizes the tradeoff regulators face when choosing between…

General Economics · Economics 2025-07-28 Christopher Clayton , Antonio Coppola

Quotient is a basic operation of formal languages, which plays a key role in the construction of minimal deterministic finite automata (DFA) and the universal automata. In this paper, we extend this operation to formal power series and…

Formal Languages and Automata Theory · Computer Science 2012-03-13 Yongming Li , Qian Wang , Sanjiang Li

Non-deterministic Finite Automata (NFA) represent regular languages concisely, increasing their appeal for applications such as word recognition. This paper proposes a new approach to generate NFA from an interaction language such as UML…

Formal Languages and Automata Theory · Computer Science 2023-08-04 Erwan Mahe , Boutheina Bannour , Christophe Gaston , Arnault Lapitre , Pascale Le Gall

We introduce and investigate a weighted propositional configuration logic over commutative semirings. Our logic is intended to serve as a specification language for software architectures with quantitative features. We prove an efficient…

Logic in Computer Science · Computer Science 2020-01-20 Paulina Paraponiari , George Rahonis

Systemic risk is a rapidly developing area of research. Classical financial models often do not adequately reflect the phenomena of bubbles, crises, and transitions between them during credit cycles. To study very improbable events,…

Mathematical Finance · Quantitative Finance 2023-05-11 Kamil Fortuna , Janusz Szwabiński

Families of DFAs (FDFAs) have recently been introduced as a new representation of $\omega$-regular languages. They target ultimately periodic words, with acceptors revolving around accepting some representation $u\cdot v^\omega$. Three…

Formal Languages and Automata Theory · Computer Science 2023-07-17 Yong Li , Sven Schewe , Qiyi Tang

Cardinality-based feature models permit to select multiple copies of the same feature, thus generalizing the notion of product configurations from subsets of Boolean features to multisets of feature instances. This increased expressiveness…

Software Engineering · Computer Science 2024-07-08 Robert Müller , Mathis Weiß , Malte Lochau

Quantitative analysis of computing systems is an emerging area in automated formal analysis. Such properties address aspects such as costs and rewards, quality measures, resource consumption, distance metrics, etc. Existing solutions for…

Formal Languages and Automata Theory · Computer Science 2020-10-06 Suguman Bansal

Hybrid automata are a natural framework for modeling and analyzing systems which exhibit a mixed discrete continuous behaviour. However, the standard operational semantics defined over such models implicitly assume perfect knowledge of the…

Systems and Control · Computer Science 2013-08-27 Alberto Casagrande , Tommaso Dreossi , Carla Piazza

Financial models are studied where each asset may potentially lose value relative to any other. Conditioning on non-devaluation, each asset can serve as proper num\'eraire and classical valuation rules can be formulated. It is shown when…

Pricing of Securities · Quantitative Finance 2017-10-19 Travis Fisher , Sergio Pulido , Johannes Ruf

The complexity of financial data, characterized by its variability and low signal-to-noise ratio, necessitates advanced methods in quantitative investment that prioritize both performance and interpretability.Transitioning from early manual…

Computational Finance · Quantitative Finance 2024-12-13 Hao Shi , Weili Song , Xinting Zhang , Jiahe Shi , Cuicui Luo , Xiang Ao , Hamid Arian , Luis Seco

Formal Concept Analysis (FCA) is a mathematical framework for knowledge representation and discovery. It performs a hierarchical clustering over a set of objects described by attributes, resulting in conceptual structures in which objects…

Artificial Intelligence · Computer Science 2025-08-12 Jessie Galasso

We present an SMT-based active learning algorithm for nondeterministic weighted automata (WFAs) as a practical and robust alternative to Hankel/L*-style methods. Our algorithm is parametric in a given semiring and, if it terminates,…

Formal Languages and Automata Theory · Computer Science 2026-05-11 Tiago Ferreira , Kevin Batz , Alexandra Silva

Understanding how a learned black box works is of crucial interest for the future of Machine Learning. In this paper, we pioneer the question of the global interpretability of learned black box models that assign numerical values to…

Machine Learning · Computer Science 2018-10-16 Stephane Ayache , Remi Eyraud , Noe Goudian

Various financial market scenarios may cause heterogeneous risk assessments among analysts, which motivates the usage of the Generalized Risk Measure in Fadina et al. (2024, Finance and Stochastics). Effectively synthesizing these diverse…

Risk Management · Quantitative Finance 2026-03-13 Yang Liu , Yunran Wei , Xintao Ye