An application of first-order logic to the study of recognizable languages

International Journal of Algebra and Computation

Volumn 14, Issue 5-6, 2004, Pages 785-799

  Silva, Pedro V ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Decidability; First order logic; Recognizable languages

Indexed keywords

EID: 12344251880     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218196704001906     Document Type: Conference Paper

References (7)

1. J. Berstel, Transductions and Context-free Languages (Teubner, 1979).
2. J. C. Birget, S. Margolis, J. Meakin and P. Weil, PSPACE-completeness of certain algorithmic problems on the subgroups of the free groups, in Proceedings ICALP 94, LNCS (1994), pp. 274-285.
3. J. C. Birget, S. Margolis, J. Meakin and P. Weil, PSPACE-completeness of certain algorithmic problems on the subgroups of the free groups, Theoret. Comp. Sci. 242 (2000) 247-281.
4. S. Eilenberg, C. C. Elgot and J. C. Shepherdson, Sets recognized by n-tape automata, J. Algebra 13 (1969) 447-464.
5. E. Mendelson, Introduction to Mathematical Logic (D. Van Nostrand Company, 1979).
6. C. Savioz and H. Läuchli, Monadic second order definable relations on the binary tree, J. Symb. Logic 52 (1987) 219-226.
7. P. V. Silva, A note on pure and p-pure languages, Acta Informatica, 39 (2003) 579-595.