|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
SS, DC |
2021-10-19 15:25 |
Online |
Online |
A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Register Automata Akira Onishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2021-17 DC2021-22 |
Register automaton (abbreviated as RA) is an extension of finite automaton by adding
registers storing data values. RA ... [more] |
SS2021-17 DC2021-22 pp.23-28 |
SS |
2021-03-03 10:25 |
Online |
Online |
A Subclass of LTL with the Freeze Quantifier Translatable into Register Automata Akira Onishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2020-29 |
Register automaton (abbreviated as RA) is an extension of finite automaton by adding
registers storing data values. RA ... [more] |
SS2020-29 pp.7-12 |
MSS, SS |
2021-01-27 15:25 |
Online |
Online |
Pumping Lemmas for Languages Expressed by Computational Models with Registers Rindo Nakanishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) MSS2020-41 SS2020-26 |
Register automaton (RA), register context-free grammar (RCFG), and register tree automaton (RTA) are computational model... [more] |
MSS2020-41 SS2020-26 pp.72-77 |
DC, SS |
2020-10-19 13:25 |
Online |
Online |
LTL Model Checking for Register Pushdown Systems Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2020-6 DC2020-23 |
A pushdown system (PDS) is known as an abstract model of recursive programs.
For PDS, model checking methods have been ... [more] |
SS2020-6 DC2020-23 pp.7-12 |
SS, MSS |
2018-01-18 14:15 |
Hiroshima |
|
Computational Complexity of Membership and Emptiness Problems for Register Context-Free Grammars Ryoma Senda, Hiroyuki Seki (Nagoya Univ.) MSS2017-54 SS2017-41 |
Register context-free grammar (RCFG) is an extension of context-free grammar to handle data values. RCFGs can be applied... [more] |
MSS2017-54 SS2017-41 pp.41-46 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|