An approximation algorithm for state minimization in 2-MDFAs

Article Properties
  • Language
    English
  • DOI (url)
    10.1007/s00165-006-0005-4
  • Publication Date
    2006/12/01
  • Journal
    Formal Aspects of Computing
  • Indian UGC (journal)
  • Refrences
    14
  • K. Subramani Lane Department of Computer Science and Electrical Engineering, West Virginia University, 26506, Morgantown, WV, USA
  • C. Tauras Lane Department of Computer Science and Electrical Engineering, West Virginia University, 26506, Morgantown, WV, USA
Abstract
Cite
Subramani, K., and C. Tauras. “An Approximation Algorithm for State Minimization in 2-MDFAs”. Formal Aspects of Computing, vol. 18, no. 4, 2006, pp. 421-3, https://doi.org/10.1007/s00165-006-0005-4.
Subramani, K., & Tauras, C. (2006). An approximation algorithm for state minimization in 2-MDFAs. Formal Aspects of Computing, 18(4), 421-431. https://doi.org/10.1007/s00165-006-0005-4
Subramani K, Tauras C. An approximation algorithm for state minimization in 2-MDFAs. Formal Aspects of Computing. 2006;18(4):421-3.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
The state complexities of some basic operations on regular languages 1994
Introduction to automata theory, language, and computation 2001
Introduction to algorithms 1992
Theory of Machines and Computations. 1971
10.1109/SWAT.1971.11