Cover Image

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages

Fuente: arXiv

Saved in:

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

Similar Items

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

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

Density of rational languages under shift invariant measures
by: Berthé, Valérie, et al.
Published: (2025)

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

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

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

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

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

A substitution lemma for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)

A polynomial-time algorithm for the automatic Baire property
by: Staiger, Ludwig
Published: (2025)

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

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

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)

Nondeterministic tree-walking automata are not closed under complementation
by: Martynova, Olga, 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)

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)

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)

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

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

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

Kunz languages for numerical semigroups are context sensitive
by: Delgado, Manuel, et al.
Published: (2023)

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

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

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

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

On universality of regular realizability problems
by: Rubtsov, Alexander, et al.
Published: (2023)

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

Illustrating Finite Automata with Grail+ and TikZ
by: May, Alastair, et al.
Published: (2024)

On Languages Describing Large Graph Classes
by: Fernau, Henning, et al.
Published: (2026)

A note on Automatic Baire property
by: Staiger, Ludwig
Published: (2025)

Weakly-unambiguous Parikh automata and their link to holonomic series
by: Bostan, Alin, et al.
Published: (2025)

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

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)

Weighing Obese Timed Languages
by: Asarin, Eugene, et al.
Published: (2025)

Computing the Bandwidth of Meager Timed Automata
by: Asarin, Eugene, et al.
Published: (2024)