Advertisement

Decidable Containment Problems of Rational Word Relations

  • Wojciech Fraczak
  • Stéphane Hassen
Chapter
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 110)

Abstract

We study a particular case of the inclusion problem for rational relations over words. The problem consists in checking whether a submonoid, M, is included in a rational relation, R. We show that if M is rational and commutative then the problem MR is decidable. In the second part of the paper we study the inclusion problem, M↓R, where M is a commutative submonoid and ↓R is the prefix-closure of a rational word relation R. We describe an algorithm which solves the problem in a polynomial time, assuming that the number of tapes (arity of the word relation) is constant.

Keywords

Formal language Multi-tape automata Rational relation Inclusion 

References

  1. 1.
    Berstel J (1979) Transductions and context-free languages. Teubner Verlag, StuttgartMATHGoogle Scholar
  2. 2.
    Brand D, Zafiropulo P (1983) On communicating finite-state machines. J ACM, 30(2):323–342CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Eilenberg S (1974) Automata, languages, and machines, vol A. Academic Press, New YorkMATHGoogle Scholar
  4. 4.
    Fischer MJ, Rabin MO (1974) Super-exponential complexity of presburger arithmetic. In: Proceedings of the SIAM-AMS Symposium in Applied Mathematics, volume 7, pp 27–41MathSciNetGoogle Scholar
  5. 5.
    Fischer PC (1965) Multi-tape and infinite-state automata — a survey. Commun ACM 8:799–805CrossRefMATHGoogle Scholar
  6. 6.
    Fraczak W, Hassen S (2011) A decidable instance of the inclusion problem for rational relations. In The International MultiConference of Engineers and Computer Scientists 2011, IMECS 2011, Lecture Notes in Engineering and Computer Science, Hong KongGoogle Scholar
  7. 7.
    Gilmer R (1984) Commutative semigroup rings. University of Chicago, Chicago, IllinoisMATHGoogle Scholar
  8. 8.
    Ginsburg S, Spanier EH (1966) Semigroups, Presburger formulas, and languages. Pacific J Math 16(2):285–296MATHMathSciNetGoogle Scholar
  9. 9.
    Habermehl P, Mayr R (2000) A note on SLRE. Technical report, LIAFA - Universit Denis Diderot, 2, place Jussieu, Paris Cedex 05, FranceGoogle Scholar
  10. 10.
    Johnson JH (1986) Rational equivalence relations. Theor Comput Sci 47(3):39–60CrossRefMATHGoogle Scholar
  11. 11.
    Josephs MB (2004) Models for data-flow sequential processes. In: Abdallah AE, Jones CB, Sanders JW (eds) 25 Years communicating sequential processes. Lecture notes in computer science, vol 3525. Springer, Berlin, pp 85–97Google Scholar
  12. 12.
    Klarlund N (1998) Mona & fido: The logic-automaton connection in practice. In: Selected Papers from the11th International Workshop on Computer Science Logic, CSL ’97, Springer, London, UK, pp 311–326Google Scholar
  13. 13.
    Rabin MO, Scott D (1959) Finite automata and their decision problems. IBM J Res Dev 3(2):114–125CrossRefMathSciNetGoogle Scholar
  14. 14.
    Sakarovitch J (2003) Eléments de théorie des automates. Vuibert Informatique, Paris, France.MATHGoogle Scholar
  15. 15.
    Stockmeyer LJ, Meyer AR (1973) Word problems requiring exponential time (Preliminary Report). In: Proceedings of the fifth annual ACM symposium on Theory of computing, STOC ’73, ACM, New York, NY, USA, pages 1–9Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Dépt d’informatique et d’ingénierieUniversité du Québec en OutaouaisGatineauCanada

Personalised recommendations