:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Becher, Verónica, Carton, Olivier, Figueira, Santiago
Format:	Preprint
Published:	2024
Subjects:	Information Theory Formal Languages and Automata Theory
Online Access:	https://arxiv.org/abs/2406.18383
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Deterministic pushdown automata can compress some normal sequences
by: Carton, Olivier, et al.
Published: (2022)

Automata for the commutative closure of regular sets
by: Becher, Verónica, et al.
Published: (2025)

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

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

Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
by: Carton, Olivier, et al.
Published: (2024)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
by: Zhang, Kuize, et al.
Published: (2024)

Mahler equations for Zeckendorf numeration
by: Carton, Olivier, et al.
Published: (2024)

Measuring Grammatical Diversity from Small Corpora: Derivational Entropy Rates, Mean Length of Utterances, and Annotation Invariance
by: Martin, Fermin Moscoso del Prado
Published: (2024)

Explorable Parity Automata
by: Hazard, Emile, et al.
Published: (2024)

The complexity of reachability problems in strongly connected finite automata
by: Kiefer, Stefan, et al.
Published: (2025)

Characterizing normality via automata and random matrix products
by: Bienvenu, Laurent, et al.
Published: (2026)

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)

On state complexity for subword-closed languages
by: Guyot, Jérôme
Published: (2024)

Nondeterministic state complexity of square root
by: Onishchenko, Sergey
Published: (2026)

On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
by: Casares, Antonio, et al.
Published: (2024)

Infinite-state Games with Energy Objectives Beyond Counters
by: Sağlam, Irmak, et al.
Published: (2026)

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
by: Fülöp, Zoltán, et al.
Published: (2025)

Soft state reduction of fuzzy automata over residuated lattices
by: Nguyen, Linh Anh, et al.
Published: (2025)

Multi-Head Finite-State Dimension
by: Huang, Xiang, et al.
Published: (2025)

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

Banach density of generated languages: Dichotomies in topology and dimension
by: Kleinberg, Jon, et al.
Published: (2026)

Is decidability of the Submonoid Membership Problem closed under finite extensions?
by: Shafrir, Doron
Published: (2024)

Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners
by: Schmid, Markus L., et al.
Published: (2020)

The computational inevitability of life: self-replication under resource-bounded nested algorithmic probability
by: Sarkar, Aritra
Published: (2020)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
by: Petrov, Semyon, et al.
Published: (2024)

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)

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

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
by: Akshay, S., et al.
Published: (2024)

A Formal Approach for Tuning Stochastic Oscillators
by: Ballarini, Paolo, et al.
Published: (2024)

A Tree Sampler for Bounded Context-Free Languages
by: Considine, Breandan
Published: (2024)

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
by: Hausmann, Daniel, et al.
Published: (2024)

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
by: Acharya, Rohan, et al.
Published: (2024)

Characterization of Isometric Words based on Swap and Mismatch Distance
by: Anselmo, M., et al.
Published: (2024)

$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
by: Pert, Charles, et al.
Published: (2024)

Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)

Information-flow Interfaces and Security Lattices
by: Bartocci, Ezio, et al.
Published: (2024)

Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
by: Raskin, Jean-François, et al.
Published: (2024)

Two-Way One-Counter Nets Revisited
by: Almagor, Shaull, et al.
Published: (2024)

5' -> 3' Watson-Crick Automata accepting Necklaces
by: Nagy, Benedek
Published: (2024)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)