Untitled HOME GANTI PASSWORD LOGOUT




Selamat Datang
SELAMAT DATANG DI PERPUSTAKAAN ONLINE

E-JOURNAL

Completely Reachable Automata



  ID Publisher : 0000015730
  Nama Jurnal : Descriptional Complexity of Formal Systems
  Pengarang : Eugenija A. Bondar and Mikhail V. Volkov
  Subjek : Deterministic finite automaton, Complete reachability, Transition monoid, Syntactic complexity, PSPACE-completeness
  Edisi : 0 / 0 / 2016


Download File...

  Isi_Artikel_180219747649.pdf
  [ 4844068  bytes ]


Kembali


Untitled
          
LINK FAKULTAS
MENU MAHASISWA