Reducing the Ambiguity of Parikh Matrices
| Autor: | Laura K. Hutchinson, Jeffery Dick, Robert Mercaş, Daniel Reidenbach |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
050101 languages & linguistics
Computer science media_common.quotation_subject 05 social sciences 02 engineering and technology Ambiguity Projection (linear algebra) Algebra Matrix (mathematics) Parikh matrix 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 0501 psychology and cognitive sciences Alphabet Word (computer architecture) media_common |
| Zdroj: | Language and Automata Theory and Applications ISBN: 9783030406073 LATA |
| Popis: | The Parikh matrix mapping allows us to describe words using matrices. Although compact, this description comes with a level of ambiguity since a single matrix may describe multiple words. This work looks at how considering the Parikh matrices of various transformations of a given word can decrease that ambiguity. More specifically, for any word, we study the Parikh matrix of its Lyndon conjugate as well as that of its projection to a smaller alphabet. Our results demonstrate that ambiguity can often be reduced using these concepts, and we give conditions on when they succeed. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|