Cover Image

Multi-Head Finite-State Dimension

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Huang, Xiang, Li, Xiaoyuan, Lutz, Jack H., Lutz, Neil
Format:	Preprint
Published:	2025
Subjects:	Information Theory Formal Languages and Automata Theory Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multihead Finite-State Compression
by: Lutz, Neil
Published: (2025)

One Adaptive Trailing Head Can Outperform Many Oblivious Trailing Heads
by: Cruz, Julianne, et al.
Published: (2026)

Supervisory Control of a Flexible Manufacturing Unit for the Production of Two Products
by: Giagiakos, Kyriakos
Published: (2025)

Marking Data-Informativity and Data-Driven Supervisory Control of Discrete-Event Systems
by: Liu, Yingying, et al.
Published: (2026)

Nominal Automata with Name Deallocation
by: Prucker, Simon, et al.
Published: (2026)

Active Inference of Extended Finite State Machine Models with Registers and Guards
by: Groz, Roland, et al.
Published: (2026)

Opacity in Discrete Event Systems: A Perspective and Overview
by: Yin, Xiang
Published: (2026)

Optimal Sequential Flows
by: Gimbert, Hugo, et al.
Published: (2025)

Policy Synthesis for Interval MDPs via Polyhedral Lyapunov Functions
by: Monir, Negar, et al.
Published: (2026)

Fast and General Automatic Differentiation for Finite-State Methods
by: Yang, Lucas Ondel, et al.
Published: (2026)

Efficient Constructions of Finite-State Independent Normal Pairs
by: Pulari, Subin
Published: (2026)

Engineering an LTLf Synthesis Tool
by: Duret-Lutz, Alexandre, et al.
Published: (2025)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)

On Algorithms verifying Initial-and-Final-State Opacity: Complexity, Special Cases, and Comparison
by: Masopust, Tomáš, et al.
Published: (2024)

The Agafonov and Schnorr-Stimm theorems for probabilistic automata
by: Bienvenu, Laurent, et al.
Published: (2025)

Rauzy dimension and finite-state dimension
by: Becher, Verónica, et al.
Published: (2024)

A Unifying Framework for Global Optimization: From Theory to Formalization
by: Serré, Gaëtan, et al.
Published: (2025)

Approximate Problems for Finite Transducers
by: Filiot, Emmanuel, et al.
Published: (2025)

Tokenization as Finite-State Transduction
by: Cognetta, Marco, et al.
Published: (2024)

Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)

Finite-valued Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2024)

Repetitive Finite Automata With Translucent Letters
by: Mráz, František, et al.
Published: (2024)

Opacity Enforcement by Edit Functions Under Incomparable Observations
by: Duan, Wei, et al.
Published: (2024)

Finite maximal codes and factorizations of cyclic groups
by: De Felice, Clelia
Published: (2022)

Descriptional Complexity of Finite Automata -- Selected Highlights
by: Salomaa, Arto, et al.
Published: (2023)

Measure Many Quantum Finite Automata on Infinite Words
by: Midya, Abhisek, et al.
Published: (2026)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
by: Lacroce, Clara, et al.
Published: (2023)

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
by: Kostolányi, Peter, et al.
Published: (2026)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
by: Chocholatý, David, et al.
Published: (2023)

Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing
by: Kuriyama, Takayuki
Published: (2014)

New Insights into the Decidability of Opacity in Timed Automata
by: Deng, Weilin, et al.
Published: (2025)

On the Complexity of the Secret Protection Problem for Discrete-Event Systems
by: Masopust, Tomáš, et al.
Published: (2025)

Secret Protection in Labeled Petri Nets
by: Haar, Stefan, et al.
Published: (2025)

Overview of Controllability Definitions in Supervisory Control Theory
by: Keiren, Jeroen J. A., et al.
Published: (2025)

On the Completeness and Ordering of Path-Complete Barrier Functions
by: Anand, Mahathi, et al.
Published: (2025)

Switching Controller Synthesis for Hybrid Systems Against STL Formulas
by: Su, Han, et al.
Published: (2024)

Data-Driven Abstractions for Control Systems via Random Exploration
by: Coppola, Rudi, et al.
Published: (2024)

Hyper parametric timed CTL
by: Waga, Masaki, et al.
Published: (2024)

Over-approximation of weakly-hard constraints for control systems verification (Extended)
by: de Maeyer, Rieke, et al.
Published: (2026)