scientific article; zbMATH DE number 7407779
From MaRDI portal
Publication:5155668
Recommendations
- Pumping lemmas for weighted automata
- Weighted automata
- On deterministic weighted automata
- Weighted finite automata over hemirings
- On the determinization of weighted finite automata
- scientific article; zbMATH DE number 1223726
- A Kleene theorem for weighted -pushdown automata
- A unifying Kleene theorem for weighted finite automata
- Weighted automata algorithms
- Rigorous approximated determinization of weighted automata
Cites work
- 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
- An application of games to the completeness problem for formalized theories
- Automata, Languages and Programming
- Copyless cost-register automata: structure, expressiveness, and closure properties
- Cost functions definable by min/max automata
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
- Decision problems for additive regular functions
- Elements of automata theory. Translated from the French by Reuben Thomas
- Elements of finite model theory.
- Finite-valued distance automata
- Handbook of weighted automata
- scientific article; zbMATH DE number 3115890 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Maximal partition logic: towards a logical characterization of copyless cost register automata
- On finite monoids having only trivial subgroups
- On the definition of a family of automata
- On the degree of ambiguity of finite automata
- On the positivity problem for simple linear recurrence sequences
- Pumping lemmas for weighted automata
- Quantitative Monadic Second-Order Logic
- The equality problem for rational series with multiplicities in the tropical semiring is undecidable
- Ultimate positivity is decidable for simple linear recurrence sequences
- Weak cost register automata are still powerful
- Weighted automata and weighted logics
- What's decidable about weighted automata?
Cited in
(9)- Finite ambiguity and finite sequentiality in weighted automata over fields
- Ambiguity hierarchies for weighted tree automata
- An ambiguity hierarchy of weighted context-free grammars
- A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
- Pumping lemmas for weighted automata
- Polynomially ambiguous unary weighted automata over fields
- Ambiguity Hierarchies for Weighted Tree Automata
- Finitely ambiguous and finitely sequential weighted automata over fields
- Pumping lemmas can be ``harmful
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155668)
