THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES (Q5247168): Difference between revisions

@@ Property / cites work @@
+Quantitative languages
@@ Property / cites work: Quantitative languages / rank @@
+Normal rank
@@ Property / cites work @@
+Determinization of weighted finite automata over strong bimonoids
+Normal rank
@@ Property / cites work @@
+Weighted automata and weighted logics
@@ Property / cites work: Weighted automata and weighted logics / rank @@
+Normal rank
@@ Property / cites work @@
+WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS
+Normal rank
@@ Property / cites work @@
+Weighted finite automata over strong bimonoids
@@ Property / cites work: Weighted finite automata over strong bimonoids / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted automata and multi-valued logics over arbitrary bounded lattices
+Normal rank
@@ Property / cites work @@
+Weighted pushdown systems and their application to interprocedural dataflow analysis
+Normal rank
@@ Property / cites work @@
+On the definition of a family of automata
@@ Property / cites work: On the definition of a family of automata / rank @@
+Normal rank