Semirings, automata, languages
Semirings, automata, languages
Formal languages
Rational series and their languages
Rational series and their languages
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Valuations of languages, with applications to fractal geometry
Theoretical Computer Science
Extended finite automata over groups
Discrete Applied Mathematics
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Theory of Codes
Valuations and Unambiguity of Languages, with Applications to Fractal Geometry
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Contextual information systems
CONTEXT'05 Proceedings of the 5th international conference on Modeling and Using Context
Hi-index | 0.01 |
This paper proposes an algebraic way of sentence valuations in a semiring. Actually, throughout the paper only valuations in the ring of integers with usual addition and multiplication are considered. These valuations take into consideration both words and their positions within the sentences. Two synonymy relations, with respect to a given valuation, are introduced. All sentences that are synonymous form a synonymy class which is actually a formal language. Some basic problems regarding the synonymy classes are formulated in the general setting but the results presented concern only very special valuations.