Cover Image

On Normality and Equidistribution for Separator Enumerators

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Pulari, Subin
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Separability and Non-Determinizability of WSTS
by: Czerwiński, Wojciech, et al.
Published: (2023)

MSO-Enumeration Over SLP-Compressed Unranked Forests
by: Lohrey, Markus, et al.
Published: (2024)

On the Separability Problem of VASS Reachability Languages
by: Keskin, Eren, et al.
Published: (2024)

Exact Separation of Words via Trace Geometry
by: Chen, Zeyu, et al.
Published: (2026)

A Sharper Upper Bound for the Separating Words Problem
by: Dumitru, Bogdan C.
Published: (2025)

Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language
by: Amarilli, Antoine, et al.
Published: (2026)

Cellular Automata based Resource Efficient Maximally Equidistributed Pseudo-Random Number Generators
by: A, Bhuvaneswari, et al.
Published: (2026)

Complete FSM Testing Using Strong Separability
by: Hierons, Robert M., et al.
Published: (2025)

From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2026)

One-clock synthesis problems
by: Lasota, Sławomir, et al.
Published: (2026)

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

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

Forgetting Event Order in Higher-Dimensional Automata
by: Zouari, Safa
Published: (2026)

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

Exact Accepting-State Spectrum for Reversal of Permutation Automata
by: German, Samuel
Published: (2026)

Temporal Causal Models as a Model of Computation
by: Gladyshev, Maksim, et al.
Published: (2026)

The Similarity Control Problem with Required Events
by: Wang, Yu, et al.
Published: (2026)

History-Deterministic Büchi Automata are Succinct
by: Casares, Antonio, et al.
Published: (2026)

Algebraic Characterization of FO-definable Languages of Higher-Dimensional Automata
by: Erlich, Enzo, et al.
Published: (2026)

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

Localising Stochasticity in Weighted Automata
by: Agarwal, Smayan, et al.
Published: (2026)

A quadratic lower bound for 2DFAs against one-way liveness
by: Adeogun, Kehinde, et al.
Published: (2026)

History-Constrained Systems
by: Kuijer, Louwe B., et al.
Published: (2026)

AGDES: Automatic Generation of Dependent Event Sequences
by: Guzman, Alexander Obeid
Published: (2026)

Minimizing Streaming String Transducers: An algebraic approach
by: Benalioua, Yahia Idriss, et al.
Published: (2026)

Forbidden-Context & Ordered Grammar Systems
by: Fernau, Henning, et al.
Published: (2026)

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

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
by: Shoudai, Takayoshi, et al.
Published: (2026)

Shuffles of Context-Free Languages along Regular Trajectories
by: Barloy, Corentin, et al.
Published: (2026)

Formalized Run-Time Analysis of Active Learning -- Coalgebraically in Agda
by: Wißmann, Thorsten
Published: (2026)

Weighted Automata and Regular Expressions for Financial Systems
by: Droste, Manfred, et al.
Published: (2026)

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

Commutative algebras of series
by: Clemente, Lorenzo
Published: (2026)

Star Complexity of Parikh Images of Languages over Infinite Alphabets
by: Danieli, Yoav
Published: (2026)

Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
by: Stan, Daniel, et al.
Published: (2026)

Automata on Graph Alphabets
by: Bazille, Hugo, et al.
Published: (2026)

TARZAN: A Region-Based Library for Forward and Backward Reachability of Timed Automata (Extended Version)
by: Manini, Andrea, et al.
Published: (2026)

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