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

Plus Weighted Finite State Automaton

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…Bloom and Hsu [2] extended the notion of graceful labeling to directed graphs. Further this work can be extended in the field of automata theory [6,7,8,9,10,11] which has a wide range of application in automata theory. There are many applications in graph labeling under undirected [16,17,18,19,20,21] and directed graph [12,13,14,15]…”
Section: Introductionmentioning
confidence: 99%
“…Bloom and Hsu [2] extended the notion of graceful labeling to directed graphs. Further this work can be extended in the field of automata theory [6,7,8,9,10,11] which has a wide range of application in automata theory. There are many applications in graph labeling under undirected [16,17,18,19,20,21] and directed graph [12,13,14,15]…”
Section: Introductionmentioning
confidence: 99%
“…From the viewpoint of the syntax directed description of fuzzy meanings, sets of trees rather than the sets of strings are of prime importance. A plus weighted automata [8,9,10,11] is an automata that deals with plus weights up to infinity. Many algebraic structures of plus weighted automata has been discussed in [8,9,10].…”
Section: Introductionmentioning
confidence: 99%
“…Bloom and Hsu [2] extended the notion of graceful labeling to directed graphs. Further this work can be extended in the field of automata theory [13,14,15,16,17,18,19] which has a wide range of application in automata theory. There are many applications in graph labeling under undirected [20,24,25,26,27,28,29,30] and directed graph [21,22,23].…”
Section: Introductionmentioning
confidence: 99%