Cover Image

The Expansion Problem for Infinite Trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Blumensath, Achim
Format:	Preprint
Published:	2023
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

The Power-Set Construction for Tree Algebras
by: Blumensath, Achim
Published: (2022)

Some Remarks on First-Order Definable Tree Languages
by: Blumensath, Achim
Published: (2024)

Reversible Transducers over Infinite Words
by: Dartois, Luc, et al.
Published: (2024)

Higher-Dimensional Automata : Extension to Infinite Tracks
by: Passemard, Luc, et al.
Published: (2025)

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

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

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

Approximate Problems for Finite Transducers
by: Filiot, Emmanuel, et al.
Published: (2025)

Saturation Problems for Families of Automata
by: Bohn, León, et al.
Published: (2025)

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

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

Resynchronized Uniformization and Definability Problems for Rational Relations
by: Löding, Christof, et al.
Published: (2021)

Undecidability of the Emptiness Problem for Weak Models of Distributed Computing
by: Principato, Flavio T., et al.
Published: (2025)

Uniform Membership for Hyperedge Replacement Grammars and Related Decision Problems
by: Pshenitsyn, Tikhon
Published: (2025)

Fine-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs
by: Drabik, Karolina, et al.
Published: (2025)

Characterizing Implementability of Global Protocols with Infinite States and Data
by: Li, Elaine, et al.
Published: (2024)

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

Global One-Counter Tree Automata
by: Herrmann, Luisa, et al.
Published: (2024)

Attributed Tree Transducers for Partial Functions
by: Maneth, Sebastian, et al.
Published: (2024)

Non-Global Parikh Tree Automata
by: Herrmann, Luisa, et al.
Published: (2024)

Scalable Tree-based Register Automata Learning
by: Dierl, Simon, et al.
Published: (2024)

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

Regular Grammars for Sets of Graphs of Tree-Width 2
by: Bozga, Marius, et al.
Published: (2024)

Weighted Tree Automata -- May it be a little more?
by: Fülöp, Zoltán, et al.
Published: (2022)

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

Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers
by: Gallot, Paul, et al.
Published: (2023)

When is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?
by: Maneth, Sebastian, et al.
Published: (2025)

The Trembling-Hand Problem for LTLf Planning
by: Yu, Pian, et al.
Published: (2024)

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2025)

Automaton-based Characterisations of First Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2026)

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

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

Completing the picture for the Skolem Problem on order-4 linear recurrence sequences
by: Bacik, Piotr
Published: (2024)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
by: Chocholatý, David, et al.
Published: (2023)

Simulation Limitations of Affine Cellular Automata
by: Hudcová, Barbora, et al.
Published: (2023)

On the Expressive Power of Regular Expressions with Backreferences
by: Nogami, Taisei, et al.
Published: (2023)

Safety and Liveness of Quantitative Properties and Automata
by: Boker, Udi, et al.
Published: (2023)

Note on dissecting power of regular languages
by: Rukavicka, Josef
Published: (2023)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
by: Lacroce, Clara, et al.
Published: (2023)

Checking History-Determinism is NP-hard for Parity Automata
by: Prakash, Keya
Published: (2023)