2017
DOI: 10.29055/jcms/705
|View full text |Cite
|
Sign up to set email alerts
|

A Study on Recognizability of Max Weighted Finite State State Automaton

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Thus we are motivated to study systems to manipulate plus weighted dendrolanguage generating system which is the generalization of fuzzy Context Free Dendrolanguage generating System. Plus weighted Dendrolanguage generating System can also be extended to max weighted automata cited as [2,3,4,5,6]. This work can be further motivated to work in Labeling of trees in graph theory [13,14,15,16,17,18] with plus weights which will give more focus on the paths it prefer.…”
Section: Introductionmentioning
confidence: 99%
“…Thus we are motivated to study systems to manipulate plus weighted dendrolanguage generating system which is the generalization of fuzzy Context Free Dendrolanguage generating System. Plus weighted Dendrolanguage generating System can also be extended to max weighted automata cited as [2,3,4,5,6]. This work can be further motivated to work in Labeling of trees in graph theory [13,14,15,16,17,18] with plus weights which will give more focus on the paths it prefer.…”
Section: Introductionmentioning
confidence: 99%