Interoperability of constrained finite state automata

  • Authors:
  • Dipankar Majumdar;Swapan Bhattacharya

  • Affiliations:
  • RCC Institute of Information Technology, Kolkata, India;Jadavpur University, Kolkata, India

  • Venue:
  • ACM SIGSOFT Software Engineering Notes
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Finite State Automata have been extended in a number of ways with varied additional constraints with an objective of modeling varied real life problems. The current paper commonly refers to such extensions as constrained automata. It aims at defining a generic mathematical model for the constrained automata targeted towards interoperability and possible integration amongst them. The paper proposes and demonstrates usage of hyper complex symbols that realizes the objective.