COMPLEXITY IN UNION-FREE REGULAR LANGUAGES

Article Properties
  • Language
    English
  • Publication Date
    2011/11/01
  • Indian UGC (journal)
  • Refrences
    26
  • GALINA JIRÁSKOVÁ Mathematical Institute, Slovak Academy of Sciences Grešákova 6, 040 01 Košice, Slovakia
  • TOMÁŠ MASOPUST CWI, P.O. Box 94079, 1090 GB Amsterdam, The NetherlandsMathematical Institute, Czech Academy of Sciences, Žižkova 22, 616 62 Brno, Czech Republic
Abstract
Cite
JIRÁSKOVÁ, GALINA, and TOMÁŠ MASOPUST. “COMPLEXITY IN UNION-FREE REGULAR LANGUAGES”. International Journal of Foundations of Computer Science, vol. 22, no. 07, 2011, pp. 1639-53, https://doi.org/10.1142/s0129054111008933.
JIRÁSKOVÁ, G., & MASOPUST, T. (2011). COMPLEXITY IN UNION-FREE REGULAR LANGUAGES. International Journal of Foundations of Computer Science, 22(07), 1639-1653. https://doi.org/10.1142/s0129054111008933
JIRÁSKOVÁ G, MASOPUST T. COMPLEXITY IN UNION-FREE REGULAR LANGUAGES. International Journal of Foundations of Computer Science. 2011;22(07):1639-53.
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
Refrences
Title Journal Journal Categories Citations Publication Date
10.5486/PMD.2006.3303
10.5486/PMD.2006.3303
10.5486/PMD.2006.3303 International Journal of Foundations of Computer Science
  • 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
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
10.5486/PMD.2006.3303
10.5486/PMD.2006.3303