본문

서브메뉴

검색

  1. Home
A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages
A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages / Rong...
A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages

Detailed Information

자료유형  
 기사
ISSN  
00189286
서명/저자  
A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages / Rong, S.
형태사항  
pp. 534
기타저자  
Rong, S.
기본자료저록  
IEEE transactions on Automatic Control : v.60 n.2 2015, 02
모체레코드  
모체정보확인
Control Number  
gtec:342093

MARC

 008170928s2015              a    a                          kor
■022    ▼a00189286
■245    ▼aA  Polynomial-Time  Algorithm  for  Computing  Finite-Makespan  Controllable  Sublanguages▼dRong,  S.
■300    ▼app.  534
■7001  ▼aRong,  S.
■773    ▼tIEEE  transactions  on  Automatic  Control▼gv.60  n.2▼d2015,  02
■SIS    ▼aKS030361▼b63263▼h3▼sG

Preview

Export

ChatGPT Discussion

AI Recommended Related Books


    New Books MORE
    Related books MORE
    Statistics for the past 3 years. Go to brief
    Recommend

    פרט מידע

    • הזמנה
    • Book Loan Request Service
    • התיקיה שלי
    גשמי
    Reg No. Call No. מיקום מצב להשאיל מידע
    AR24777 종합자료실 대출가능 대출가능
    대출신청 My Folder

    * הזמנות זמינים בספר ההשאלה. כדי להזמין, נא לחץ על כפתור ההזמנה

    Books borrowed together with this book

    Related books

    Related Popular Books

    도서위치