Cover Image

Context-Free Trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wächter, Jan Philipp
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory Group Theory 68Q17, 68R10, 05C62, 68Q45 F.4.m
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Word Problem for Finitary Automaton Groups
by: Kotowsky, Maximilian, et al.
Published: (2023)

The Freeness Problem for Automaton Semigroups
by: D'Angeli, Daniele, et al.
Published: (2024)

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

A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
by: Cho, Da-Jung, et al.
Published: (2025)

On the ET0L subgroup membership problem in bounded automata groups
by: Bishop, Alex, et al.
Published: (2024)

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

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

Preserving self-similarity in free products of semigroups
by: Brough, Tara Macalister, et al.
Published: (2020)

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

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

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

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

Nominal Tree Automata With Name Allocation
by: Prucker, Simon, et al.
Published: (2024)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
by: Eickmeyer, Kord, et al.
Published: (2025)

Bandwidth of Nondeterministic Finite Automata
by: Cho, Da-Jung, et al.
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)

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

Decomposition of Automata recognizing Ideals
by: Berry, Mathias, et al.
Published: (2026)

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

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

Learning Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2025)

Alternating Nominal Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2024)

Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)

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

Generalized Parikh Matrices For Tracking Subsequence Occurrences
by: Fazekas, Szilárd Zsolt, et al.
Published: (2024)

The Word Problem for $(ω- 1)$-Terms over $\mathrm{DAb}$
by: Almeida, Jorge, et al.
Published: (2024)

Anti-Context-Free languages
by: Cardó, Carles
Published: (2024)

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
by: Cojocaru, Liliana
Published: (2015)

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)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
by: Deng, Zhibo, et al.
Published: (2025)

Hexagonal Picture Scanning Automata
by: D, Deepalakshmi, et al.
Published: (2025)

Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
by: Alpay, Faruk, et al.
Published: (2026)

A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations
by: Heuberger, Clemens, et al.
Published: (2022)

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)