Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-27T23:33:28.278Z Has data issue: false hasContentIssue false
  • English
  • Français

Parikh test sets for commutative languages

Published online by Cambridge University Press:  03 June 2008

Štěpán Holub
Štěpán Holub*
Affiliation:
Charles University, Faculty of Mathematics and Physics, Department of Algebra, Sokolovská 83, 175 86 Praha, Czech Republic; holub@karlin.mff.cuni.cz
Get access

Abstract

A set T ⊆ L is a Parikh test set of L if c(T) is a test set of c(L). We give a characterization of Parikh test sets for arbitrary language in terms of its Parikh basis, and the coincidence graph of letters.

Keywords

Combinatorics on wordstest setscommutative languages.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 42 , Issue 3: JM'06 , July 2008 , pp. 525 - 537
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ismo Hakala and Juha Kortelainen, Polynomial, size test sets for commutative languages. RAIRO-Theor. Inf. Appl. 31 (1997) 291–304.
Štěpán Holub and Juha Kortelainen, Linear, size test sets for certain commutative languages. RAIRO-Theor. Inf. Appl. 35 (2001) 453–475.
Michel, Latteux, Rational cones and commutations. In Machines, languages, and complexity (Smolenice, 1988). Lect. Notes Comput. Sci. 381 (1989) 37–54.