Art

J-GLOBAL ID：200902238022364900   Reference number：03A0328464

Las Vegas, Self-Verifying Nondeterministic and Deterministic One-Way Multi-Counter Automata with Bounded Time

ラスベガス,自己検証非決定性,及び決定性の時間制限1方向マルチカウンタオートマトン

Author (2)： YOSHINAGA T (Tokuyama Coll. Technol., Tokuyama-shi, JPN) ,  INOUE K (Yamaguchi Univ., Ube-shi, JPN)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng))
Volume： E86-A  Issue： 5  Page： 1207-1212  Publication year： May. 01, 2003 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 短報  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *computational complexity theory ,...
Semi thesaurus term： computational complexity ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=03A0328464&from=J-GLOBAL&jstjournalNo=F0699C") }}

JST classification (1)： Theory of computation  (JB02000A)

Reference (8)：

• DURIS, P. A separation of determinism, Las Vegas and nondeterminism for picture recognition. Proc. 15th Annual IEEE Conference on Communication Complexity. 2000, 214-228
• INOUE, K. Self-verifying nondeterministic and Las Vegas multihead finite automata. IEICE Trans. Fundamentals. 2001, E84-A, 5, 1094-1101
• HROMKOVIC, J. On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata. Information and Computation. 2001, 169, 284-296
• DURIS, P. Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomil-time computations. Proc. STACS 1200. 1997, 117-128
• HROMKOVIC, J. On the power of Las Vegas II, two-way finite automata. Proc. ICALP 99. 1999, 433-443

Terms in the title (6)： ラスベガス ,  自己 ,  検証 ,  非決定性 ,  制限 ,  1方向