Automata with Truth Values in Lattice Moniod and Grammars

Sheng Li · 2004

The relationships between lattice_valued automata and grammars are disscused in this paper. And got the following results, for a given lattice_valued regular grammar, there exists a lattice_valued automation such that they accept the same language,and for a given lattice_valued automation, there is a lattice_valued regular grammar such that they accept the same language.

Read the paper · More papers on PaperTik