Cover Image

Run supports and initial algebra supports of weighted automata

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Droste, Manfred, Vogler, Heiko
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory 68Q45 (Primary) 03D05, 03D15 (Secondary) F.4.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
by: Lopez, Aliaume
Published: (2024)

Decision Problems on Copying and Shuffling
by: Halava, Vesa, et al.
Published: (2023)

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

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

Word equations and the exponent of periodicity
by: Diekert, Volker, et al.
Published: (2025)

On the Intersection Problem for Quantum Finite Automata
by: Benso, Andrea, et al.
Published: (2024)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
by: Nakano, Keisuke, et al.
Published: (2024)

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

Lindenmayer graph languages, first-order theories and expanders
by: Knapik, Teodor
Published: (2024)

Stratifiable formulae are not context-free
by: Ryan-Smith, Calliope
Published: (2023)

Hamming distance between finite transducers
by: Dartois, Luc, et al.
Published: (2026)

An automata-based test for bricks over string algebras
by: Kuber, Amit, et al.
Published: (2026)

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

Finite-Horizon First-Order Rank Profiles of Regular Languages
by: Bazarova, Madina, et al.
Published: (2026)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

Subsets of groups with context-free preimages
by: Levine, Alex
Published: (2023)

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

Solutions of Word Equations over Partially Commutative Structures
by: Diekert, Volker, et al.
Published: (2016)

Free inverse monoids are co-context-free
by: Brough, Tara Macalister, et al.
Published: (2025)

A Logic For Fresh Labelled Transition Systems
by: Bandukara, Mohamed H, et al.
Published: (2025)

Layered automata: A canonical model for automata over infinite words
by: Casares, Antonio, et al.
Published: (2026)

The Polynomial Hierarchy does not collapse
by: Czerwinski, Reiner
Published: (2024)

Decomposition of Automata recognizing Ideals
by: Berry, Mathias, 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)

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

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

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

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

New Fault Domains for Conformance Testing of Finite State Machines
by: Vaandrager, Frits, et al.
Published: (2024)

Systematic Evaluation of Black-Box Checking for Fast Bug Detection
by: Pellen, Bram, et al.
Published: (2025)

Effective equation solving, constraints and growth in virtually abelian groups
by: Ciobanu, Laura, et al.
Published: (2023)

Transition-based vs stated-based acceptance for automata over infinite words
by: Casares, Antonio
Published: (2025)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)

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

Well-Quasi-Orderings on Word Languages
by: Lhote, Nathan, et al.
Published: (2025)

Presheaf automata
by: Struth, Georg, et al.
Published: (2024)