Abstract
The recognizable subsets of free monoid semirings are investigated. They are defined using linear automata as recognizers. For a subset of a free monoid semiring, we define the Myhill and Nerode congruences and prove a generalization of the well-known Myhill-Nerode Theorem. We consider recognizable subsets of the semiring of natural numbers. It is shown that every finite subset of and every ideal of N0 are recognizable. Examples of recognizable subsets of free semirings are also given.
Author supplied keywords
Cite
CITATION STYLE
Sokratova, O. (2001). Linear automata and recognizable subsets in free semirings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2138, pp. 420–423). Springer Verlag. https://doi.org/10.1007/3-540-44669-9_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
