ScholarLens Back to search
2006•Computer Engineering and Applications JournalRequires access

Investigations on Variants of Weighted Automata

I Virgili

Open publisher page 0 citations

Abstract

Automata theory is one of the foundations of theoretical computer science.Automata techniques have extensive use in many fields.Finite state automata are the recognizers of regular languages.Finite state automata have deterministic and nondeterministic models,which are equivalent with respect to the language recognizing ability.Weighted automata are finite automata with each transition associated with an input symbol and an element from an algebraic structure as well.The weight of any input string can be computed.Any finite automaton is a special weighted automaton.So weighted automata are more powerful and have more applications.

About this research paper

What this paper is about

Automata theory is one of the foundations of theoretical computer science.Automata techniques have extensive use in many fields.Finite state automata are the recognizers of regular languages.Finite state automata have deterministic and nondeterministic models,which are equivalent with respect to the language recognizing ability.Weighted automata are finite automata with each transition associated with an input symbol and an element from an algebraic structure as well.The weight of any input string can be computed.Any finite automaton is a special weighted automaton.So weighted automata are more powerful and have more applications.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Automata theory is one of the foundations of theoretical computer science.Automata techniques have extensive use in many fields.Finite state automata are the recognizers of regular languages.Finite state automata have deterministic and nondeterministic models,which are equivalent with respect to the language recognizing ability.Weighted automata are finite automata with each transition associated with an input symbol and an element from an algebraic structure as well.The weight of any input string can be computed.Any finite automaton is a special weighted automaton.So weighted automata are more powerful and have more applications.

Key concepts: Nondeterministic finite automaton, ω-automaton, Quantum finite automata, Deterministic finite automaton, Automata theory, Deterministic automaton, DFA minimization, Nested word

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Investigations on Variants of Weighted Automata — Research Paper | ScholarLens