Cover Image

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fülöp, Zoltán, Vogler, Heiko
Format:	Preprint
Published:	2025
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

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

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

Congruence based proofs of the recognizability theorems for free many-sorted algebras
by: Vidal, Juan Climent, et al.
Published: (2018)

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

Non-deterministic asynchronous automata games and their undecidability
by: Adsul, Bharat, et al.
Published: (2024)

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)

A pumping-like lemma for languages over infinite alphabets
by: Danieli, Yoav
Published: (2025)

Automata for the commutative closure of regular sets
by: Becher, Verónica, et al.
Published: (2025)

Navigational hierarchies of regular languages
by: Place, Thomas, et al.
Published: (2024)

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

On state complexity for subword-closed languages
by: Guyot, Jérôme
Published: (2024)

Commutative algebras of series
by: Clemente, Lorenzo
Published: (2026)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
by: Bell, Jason P., et al.
Published: (2022)

Two-way affine automata can verify every language
by: Chen, Zeyu, et al.
Published: (2025)

A short survey around the pumping lemma for context-free languages
by: Gullà, Gabriele
Published: (2024)

Computing measures of weak-MSO definable sets of trees
by: Niwiński, Damian, et al.
Published: (2024)

The complexity of reachability problems in strongly connected finite automata
by: Kiefer, Stefan, et al.
Published: (2025)

Minimizing Streaming String Transducers: An algebraic approach
by: Benalioua, Yahia Idriss, et al.
Published: (2026)

Completeness Theorems for Kleene algebra with tests and top
by: Pous, Damien, et al.
Published: (2023)

Two or three things I know about tree transducers
by: Nguyên, Lê Thành Dũng
Published: (2024)

Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
by: Zetzsche, Stefan, et al.
Published: (2024)

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

Characterization of Isometric Words based on Swap and Mismatch Distance
by: Anselmo, M., et al.
Published: (2024)

Characterizing normality via automata and random matrix products
by: Bienvenu, Laurent, et al.
Published: (2026)

Automated generation of attack trees with optimal shape and labelling
by: Gadyatskaya, Olga, et al.
Published: (2023)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
by: Schwartz, Daniel G.
Published: (2025)

Algebraic Characterization of FO-definable Languages of Higher-Dimensional Automata
by: Erlich, Enzo, et al.
Published: (2026)

Characterizations of Controlled Generation of Right Linear Grammars with Unknown Behaviors
by: Ise, Daihei, et al.
Published: (2024)

Minimizing Cost Register Automata over a Field
by: Benalioua, Yahia Idriss, et al.
Published: (2023)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
by: Zhang, Kuize, et al.
Published: (2024)

Soft state reduction of fuzzy automata over residuated lattices
by: Nguyen, Linh Anh, et al.
Published: (2025)

Learning Weighted Automata over Number Rings, Concretely and Categorically
by: Aristote, Quentin, et al.
Published: (2025)

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

Run supports and initial algebra supports of weighted automata
by: Droste, Manfred, et al.
Published: (2024)

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
by: Kostolányi, Peter, et al.
Published: (2026)

Watson-Crick conjugates of words and languages
by: Mahalingam, Kalpana, et al.
Published: (2022)

History-deterministic Timed Automata
by: Bose, Sougata, et al.
Published: (2023)

Automata-based constraints for language model decoding
by: Koo, Terry, et al.
Published: (2024)

Time complexity for deterministic string machines
by: Cataltepe, Ali, et al.
Published: (2024)

Banach density of generated languages: Dichotomies in topology and dimension
by: Kleinberg, Jon, et al.
Published: (2026)