Cover Image

The Power-Set Construction for Tree Algebras

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Blumensath, Achim
Format:	Preprint
Published:	2022
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 Expansion Problem for Infinite Trees
by: Blumensath, Achim
Published: (2023)

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

Algebra and coalgebra of stream products
by: Boreale, Michele, et al.
Published: (2021)

Standard Automata Theory and Process Algebra
by: Yodaiken, Victor
Published: (2022)

A Factorization Theorem for Forest Algebras
by: Almagor, Shaull, et al.
Published: (2026)

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

Dual Adjunction Between $Ω$-Automata and Wilke Algebra Quotients
by: Chernev, Anton, et al.
Published: (2024)

Positive Characteristic Sets for Relational Pattern Languages
by: Mousawi, S. Mahmoud, et al.
Published: (2025)

A Close Analysis of the Subset Construction
by: Baburin, Ivan, et al.
Published: (2024)

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

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
by: Angluin, Dana, et al.
Published: (2022)

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

On Decidability and Expressive Power of Fusion Grammars
by: Pshenitsyn, Tikhon
Published: (2023)

Constructing Deterministic Parity Automata from Positive and Negative Examples
by: Bohn, León, et al.
Published: (2023)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
by: Gómez-Martínez, Elena, et al.
Published: (2026)

Backward Responsibility in Transition Systems Using General Power Indices
by: Baier, Christel, et al.
Published: (2024)

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
by: Bergsträßer, Pascal, 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)

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

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

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)

Consistent Autoformalization for Constructing Mathematical Libraries
by: Zhang, Lan, et al.
Published: (2024)

The Algebras for Automatic Relations
by: Morvan, Rémi
Published: (2024)

The CFG Complexity of Singleton Sets
by: Fortnow, Lance, et al.
Published: (2024)

WEX: Formal Specifications for Windows in Stream Processing
by: Hitarth, S, et al.
Published: (2022)

Correctness Notions for Petri Nets with Identifiers
by: van der Werf, Jan Martijn E. M., et al.
Published: (2022)

Structural Reductions and Stutter Sensitive Properties
by: Paviot-Adet, Emmanuel, et al.
Published: (2022)

Finite maximal codes and factorizations of cyclic groups
by: De Felice, Clelia
Published: (2022)

History-deterministic Parikh Automata
by: Erlich, Enzo, et al.
Published: (2022)

All about unambiguous polynomial closure
by: Place, Thomas, et al.
Published: (2022)

Completely reachable automata: a quadratic decision algorithm and a quadratic upper bound on the reaching threshold
by: Ferens, Robert, et al.
Published: (2022)

Minimality Notions via Factorization Systems and Examples
by: Wißmann, Thorsten
Published: (2022)

Composing Copyless Streaming String Transducers
by: Alur, Rajeev, et al.
Published: (2022)

Binary codes that do not preserve primitivity
by: Holub, Štěpán, et al.
Published: (2022)