. . .
About Us
Education
Research
PhD
Acta Cybernetica
Conferences
Sponsors
Departments:
- Image Processing and Computer Graphics
- Technical Informatics
- Foundations of Computer Science
- Computer Algorithms and Artificial Intelligence
- Computational Optimization
- Software Engineering
- Research Group on Artificial Intelligence
[University of Szeged]
Research>>> Acta Cybernetica>>> Previous Volumes>>> Magyarul

Special Families of Matrix Languages and Decidable Problems

 

 

  A. Mateescu gif

Abstract:

  We investigate some variants of simple matrix grammars. It is proved that the equivalence problem, the inclusion problem and other problems are decidables for this families of grammars. It would be noted that all these problems are undecidable for the family of simple matrix grammars.

 Gyenizse Pal 1996. Szeptember 4. Szerda 14:17:36 MET DST
Webmaster:webmaster@inf.u-szeged.hu