Cover Image

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bell, Jason P., Smertnig, Daniel
Format:	Preprint
Published:	2022
Subjects:	Formal Languages and Automata Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
by: Dennunzio, Alberto, et al.
Published: (2026)

Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
by: Mazowiecki, Filip, et al.
Published: (2025)

Deterministic pushdown automata can compress some normal sequences
by: Carton, Olivier, et al.
Published: (2022)

Unambiguous Acceptance of Thin Coalgebras
by: Chernev, Anton, et al.
Published: (2025)

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

Consecutive Power Occurrences in Sturmian Words
by: Bell, Jason, et al.
Published: (2024)

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

Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
by: Kiefer, Stefan, et al.
Published: (2019)

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

Jumbled Scattered Factors
by: Fleischmann, Pamela, et al.
Published: (2025)

$2$-word-$π$-representable Graphs
by: Adamson, Duncan, et al.
Published: (2026)

Synchronization of strongly connected partial DFAs and prefix codes
by: Berlinkov, Mikhail V., et al.
Published: (2021)

From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth
by: Bonizzoni, Paola, et al.
Published: (2024)

Word-Representable Graphs and Locality of Words
by: Böll, Philipp, et al.
Published: (2025)

Maximal 2-dimensional binary words of bounded degree
by: Massé, Alexandre Blondin, et al.
Published: (2025)

Half-flips are 5-avoidable
by: Ochem, Pascal
Published: (2026)

On a sequence of Kimberling and its relationship to the Tribonacci word
by: Dvořáková, Lubomíra, et al.
Published: (2025)

Database-assisted automata learning
by: Walinga, Hielke, et al.
Published: (2024)

Deciding Subtyping for Asynchronous Multiparty Sessions
by: Li, Elaine, et al.
Published: (2024)

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

Cerny type automata and rank conjecture
by: Rystsov, Igor
Published: (2025)

Conway's cosmological theorem and automata theory
by: Lairez, Pierre, et al.
Published: (2024)

A generalization of Deterministic Finite Automata related to discharging
by: Campbell, John M.
Published: (2025)

On Decidability Timed Automata with 2 Parametric Clocks
by: Bersani, Marcello M., et al.
Published: (2025)

Beatty Sequences for a Quadratic Irrational: Decidability and Applications
by: Schaeffer, Luke, et al.
Published: (2024)

The complexity of separability for semilinear sets and Parikh automata
by: Collins, Elias Rojas, et al.
Published: (2024)

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

Diagnosability of labeled $\mathfrak{D_p}$ automata
by: Zhang, Kuize, et al.
Published: (2021)

The complexity of finite smooth words over binary alphabets
by: Cassaigne, Julien, et al.
Published: (2026)

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

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

Nondeterminism makes unary 1-limited automata concise
by: Guillon, Bruno, et al.
Published: (2025)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)

Exact descriptional complexity of determinization of input-driven pushdown automata
by: Martynova, Olga
Published: (2024)

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

On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
by: Casares, Antonio, et al.
Published: (2024)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
by: Mengel, Stefan, et al.
Published: (2024)

Cluster automata
by: Kornai, András
Published: (2025)

State estimation of timed automata under partial observation [Draft version]
by: Gao, Chao, et al.
Published: (2024)