A note on pure and p-pure languages

Acta Informatica

Volumn 39, Issue 8, 2003, Pages 579-595

  Silva, Pedro V ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

RATIONAL LANGUAGES;

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING;

INFORMATION ANALYSIS;

EID: 0042515043     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00236-003-0107-x     Document Type: Article

References (8)

1. J. Berstel, Transductions and Context-free Languages, Teubner, 1979
2. J. C. Birget, S. Margolis, J. Meakin, P. Weil, PSPACE-completeness of certain algorithmic problems on the subgroups of the free groups. In: Proceedings ICALP 94, pp 274-285, LNCS 1994
3. J. C. Birget, S. Margolis, J. Meakin, P. Weil, PSPACE-completeness of certain algorithmic problems on the subgroups of the free groups, Theoret. Comp. Sci. 242, 247-281 (2000)
4. J. E. Hopcroft, J. D. Ullman, Formal Languages and Their Relation to Automata, Reading, MA: Addison-Wesley 1969
5. W. Magnus, A. Karrass, D. Solitar, Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations, New York: Wiley 1966
6. E. Mendelson, Introduction to Mathematical Logic, D. Van Nostrand Company, 1979
7. H. E. Rose, A Course in Number Theory, Oxford Science Publications, 1988
8. G. Sénizergues, On the rational subsets of the free group, Acta Informatica 33, 281-296 (1996)