We present three pumping lemmas for three classes of functions definable by fragments of weighted automata over the min-plus semiring and the semiring of natural numbers. As a corollary we show that the hierarchy of functions definable by unambiguous, finitely-ambiguous, polynomially-ambiguous weighted automata, and the full class of weighted automata is strict for the min-plus semiring
We introduce weighted variable automata over infinite alphabets and commutative semirings. We prove ...
Abstract. Weighted automata map input words to numerical values. Ap-plications of weighted automata ...
AbstractWeighted automata model quantitative aspects of systems like memory or power consumption. Re...
AbstractWeighted automata are used to describe quantitative properties in various areas such as prob...
Since the seminal work by Angluin, active learning of automata, by membership and equivalence querie...
Weighted automata map input words to numerical values. Ap- plications of weighted automata include f...
AbstractWeighted automata are used to describe quantitative properties in various areas such as prob...
Abstract. Weighted automata are used to describe quantitative prop-erties in various areas such as p...
This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree...
AbstractWe introduce a weighted logic with discounting and we establish the Büchi–Elgot theorem for ...
In the paper, we generalize an algorithm and some related results by Mohri [25] for deter-minization...
Automata theory, one of the main branches of theoretical computer science, established its roots in ...
We introduce the definition of language recognition with weighted automata, a generalization of the ...
Weighted automata are nondeterministic automata with numerical weights on transitions. They can defi...
This is a book on weighted tree automata. We present the basic definitions and some of the important...
We introduce weighted variable automata over infinite alphabets and commutative semirings. We prove ...
Abstract. Weighted automata map input words to numerical values. Ap-plications of weighted automata ...
AbstractWeighted automata model quantitative aspects of systems like memory or power consumption. Re...
AbstractWeighted automata are used to describe quantitative properties in various areas such as prob...
Since the seminal work by Angluin, active learning of automata, by membership and equivalence querie...
Weighted automata map input words to numerical values. Ap- plications of weighted automata include f...
AbstractWeighted automata are used to describe quantitative properties in various areas such as prob...
Abstract. Weighted automata are used to describe quantitative prop-erties in various areas such as p...
This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree...
AbstractWe introduce a weighted logic with discounting and we establish the Büchi–Elgot theorem for ...
In the paper, we generalize an algorithm and some related results by Mohri [25] for deter-minization...
Automata theory, one of the main branches of theoretical computer science, established its roots in ...
We introduce the definition of language recognition with weighted automata, a generalization of the ...
Weighted automata are nondeterministic automata with numerical weights on transitions. They can defi...
This is a book on weighted tree automata. We present the basic definitions and some of the important...
We introduce weighted variable automata over infinite alphabets and commutative semirings. We prove ...
Abstract. Weighted automata map input words to numerical values. Ap-plications of weighted automata ...
AbstractWeighted automata model quantitative aspects of systems like memory or power consumption. Re...