:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Berthé, Valérie, Goulet-Ouellet, Herman, Perrin, Dominique
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory 68Q45 (Primary) 37B10, 68Q70 (Secondary)
Online Access:	https://arxiv.org/abs/2504.16708
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
by: German, Samuel
Published: (2026)

Density of group languages in shift spaces
by: Berthé, Valérie, et al.
Published: (2024)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
by: Yordzhev, Krasimir
Published: (2026)

Semidirect Product Decompositions for Periodic Regular Languages
by: Inoue, Yusuke, et al.
Published: (2024)

A cornering strategy for synchronizing a DFA
by: Bradshaw, Peter, et al.
Published: (2024)

Weighted Automata and Logics Meet Computational Complexity
by: Kostolányi, Peter
Published: (2023)

On the growth of hypergeometric sequences
by: Kenison, George, et al.
Published: (2025)

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
by: Alpay, Faruk, et al.
Published: (2026)

Bandwidth of Nondeterministic Finite Automata
by: Cho, Da-Jung, et al.
Published: (2026)

Nondeterministic tree-walking automata are not closed under complementation
by: Martynova, Olga, et al.
Published: (2024)

The generating power of weighted tree automata with initial algebra semantics
by: Droste, Manfred, et al.
Published: (2024)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
by: Adsul, Bharat, et al.
Published: (2024)

A hierarchy of reversible finite automata
by: Radionova, Maria, et al.
Published: (2024)

On Computational Completeness of Semi-Conditional Matrix Grammars
by: Fernau, Henning, et al.
Published: (2024)

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)

Mostowski Index via extended register games
by: Idir, Olivier, et al.
Published: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
by: Laumen, Jasper, et al.
Published: (2026)

From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
by: Martynova, Olga, et al.
Published: (2025)

Bounded Languages Described by GF(2)-grammars
by: Makarov, Vladislav
Published: (2019)

Linear equations and recursively enumerable sets
by: Honkala, Juha
Published: (2024)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
by: Zhu, Yinfeng
Published: (2024)

Around Don's conjecture for binary completely reachable automata
by: Zhu, Yinfeng
Published: (2024)

Don's conjecture for binary completely reachable automata: an approach and its limitations
by: Casas, David, et al.
Published: (2023)

Subshifts defined by nondeterministic and alternating plane-walking automata
by: de Menibus, Benjamin Hellouin, et al.
Published: (2024)

Permutation closure for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)

Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)

On Quantum Context-Free Grammars
by: Aruja, Merina, et al.
Published: (2025)

Hamming distance between finite transducers
by: Dartois, Luc, et al.
Published: (2026)

A generalization of Deterministic Finite Automata related to discharging
by: Campbell, John M.
Published: (2025)

Simplicity and irreducibility in circular automata
by: Venturi, Riccardo
Published: (2025)

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
by: Heemstra, Jan, et al.
Published: (2025)

An algebraic characterisation of Eve-positional languages
by: Colcombet, Thomas, et al.
Published: (2026)

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)

Eve-positional languages: putting order into Büchi automata
by: Idir, Olivier
Published: (2026)

Multipass automata and group word problems
by: Ceccherini-Silberstein, Tullio, et al.
Published: (2014)

Black-box Context-free Grammar Inference for Readable & Natural Grammars
by: Arefin, Mohammad Rifat, et al.
Published: (2025)

Normal forms in Virus Machines
by: Ramírez-de-Arellano, A., et al.
Published: (2024)

Using games and universal trees to characterise the nondeterministic index of tree languages
by: Idir, Olivier, et al.
Published: (2025)

Noncommutative rational Pólya series
by: Bell, Jason, et al.
Published: (2019)

Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)