scientific article; zbMATH DE number 7407779
From MaRDI portal
Publication:5155668
zbMath1487.68143arXiv2001.06272MaRDI QIDQ5155668
Agnishom Chattopadhyay, Cristian Riveros, Anca Muscholl, Filip Mazowiecki
Publication date: 8 October 2021
Full work available at URL: https://arxiv.org/abs/2001.06272
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
An ambiguity hierarchy of weighted context-free grammars ⋮ Polynomially ambiguous unary weighted automata over fields ⋮ Ambiguity Hierarchies for Weighted Tree Automata ⋮ Finite ambiguity and finite sequentiality in weighted automata over fields ⋮ Ambiguity hierarchies for weighted tree automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Elements of finite model theory.
- Handbook of weighted automata
- On the degree of ambiguity of finite automata
- Finite-valued distance automata
- Weak cost register automata are still powerful
- Copyless cost-register automata: structure, expressiveness, and closure properties
- Weighted automata and weighted logics
- What’s Decidable about Weighted Automata?
- An application of games to the completeness problem for formalized theories
- On the definition of a family of automata
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- A Generalised Twinning Property for Minimisation of Cost Register Automata
- On the Positivity Problem for Simple Linear Recurrence Sequences,
- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
- The equality problem for rational series with multiplicities in the tropical semiring is undecidable
- Quantitative Monadic Second-Order Logic
- Decision Problems for Additive Regular Functions
- On finite monoids having only trivial subgroups
- Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata
- Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
- Automata, Languages and Programming
This page was built for publication:
