Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
SS |
2023-03-15 09:55 |
Okinawa |
(Primary: On-site, Secondary: Online) |
Regularity Preservation Property of Data Tree Rewrite Systems
-- A Subclass Decomposable into Monadic Normal Form -- Yuto Sakao, Hiroyuki Seki (Nagoya Univ.) SS2022-62 |
Let $T$ be a transformation over a class $mathcal{L}$ of languages. If for any regular language $L in mathcal{L}$, $T^*(... [more] |
SS2022-62 pp.91-96 |
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 |
SS, DC |
2017-10-19 13:45 |
Kochi |
Kochi City Culture-plaza CUL-PORT |
A Direct Update Method for Compressed Data with Top Tree Suguru Nishimura, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) SS2017-22 DC2017-21 |
This paper proposes a direct update method for a data compressed with top tree. For a given compressed data (top DAG) an... [more] |
SS2017-22 DC2017-21 pp.7-12 |
MSS, SS |
2017-01-27 14:10 |
Kyoto |
Kyoto Institute of Technology |
A Translation from a Fragment of XPath to Deterministic Selecting Tree Automata with Lookahead Using Schemas Masaya Kawamoto, Kenji Hashimoto, Seki Hiroyuki (Nagoya Univ.) MSS2016-75 SS2016-54 |
XPath is known as a query language for XML documents.
Translating an XPath formula to a deterministic tree automaton ma... [more] |
MSS2016-75 SS2016-54 pp.107-112 |
DC, SS |
2016-10-27 15:55 |
Shiga |
Hikone Kinro-Fukushi Kaikan Bldg. |
A Direct Update Method for XML Documents Including Data Values Compressed by Tree Grammars Ryunosuke Takayama, Kenji Hashimoto, Seki Hiroyuki (Nagoya Univ.) SS2016-27 DC2016-29 |
A tree grammar based compression is known as one of the compression methods for XML documents. Also, methods for updatin... [more] |
SS2016-27 DC2016-29 pp.55-60 |
KBSE, SS, IPSJ-SE [detail] |
2016-07-14 12:40 |
Hokkaido |
|
A Method of Tree Compression with Top Trees and Direct Query Evaluation Suguru Nishimura, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) SS2016-10 KBSE2016-16 |
Tree compression methods that utilize the structural information have the advantage that a compressed document can be di... [more] |
SS2016-10 KBSE2016-16 pp.93-98 |
LOIS |
2016-03-03 14:40 |
Okinawa |
Central Community Center, Miyakojima-City |
An Extension of Update Method without Decompression for Compressed Structured Documents and Its Experimental Evaluation Takeshi Goto, Ryunosuke Takayama, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) LOIS2015-75 |
XML is a {it de facto} standard for data storage and exchange, and various compression methods for XML documents have be... [more] |
LOIS2015-75 pp.69-74 |
MSS, SS |
2015-01-27 08:55 |
Tottori |
|
Direct Update of XML Documents Compressed by Tree Grammars Takeshi Goto (Nagoya Univ.), Takahiro Onoue (NAIST), Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) MSS2014-81 SS2014-45 |
XML is a de facto standard for data storage and exchange, and various compression methods for XML documents have been pr... [more] |
MSS2014-81 SS2014-45 pp.73-78 |
SS |
2014-10-23 16:15 |
Kochi |
Kochi city culture-plaza cul-port |
Query Evaluation and Update on XML Documents Compressed by Tree Grammars Takahiro Onoue (NAIST), Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ), Minoru Ito (NAIST) SS2014-28 |
XML documents often contain same repetitive substructures and various compression methods have been proposed. This paper... [more] |
SS2014-28 pp.17-22 |
SS |
2011-03-07 14:45 |
Okinawa |
Okinawa-ken Seinen Kaikan |
Tree Automata with Constraints and their Closure-Properties Katsuhisa Kurahashi, Masahiko Sakai, Naoki Nishida, Futoshi Nomura, Toshiki Sakabe, Keiichirou Kusakari (Nagoya Univ.) SS2010-63 |
Tree automata are useful in analyzing properties of term rewriting systems since the class of recognizable tree language... [more] |
SS2010-63 pp.61-66 |
COMP |
2009-09-14 11:15 |
Tottori |
Tottori University of Environmental Studies |
Recognition of a Spanning Tree of DAGs by Tree Automata Akio Fujiyoshi (Ibaraki Univ.) COMP2009-26 |
In this article, we define that a DAG is accepted by a tree automaton if the DAG has a spanning tree accepted by the tre... [more] |
COMP2009-26 pp.9-12 |
SS |
2008-12-19 11:15 |
Kochi |
Kochi Univiersity of Technology |
XML Processing Techniqes Based on Tree Automata Yoshiaki Takata (Kochi Univ. of Tech.), Hiroyuki Seki (Nara Inst. of Scei and Tech.) SS2008-46 |
Tree automata, which are finite automata over trees, have been investigated in various research areas for a long time. ... [more] |
SS2008-46 pp.43-50 |
SS |
2007-08-02 13:30 |
Hokkaido |
Hokkaido Univ. |
Recognizable Approximation of Descendant Sets for Left-Linear Oriented Conditional Term Rewriting Systems Toshiki Murata, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari (Nagoya Univ.) SS2007-16 |
The reachability problem for term rewriting systems (TRSs) is to decide whether one of two given terms is reachable to t... [more] |
SS2007-16 pp.1-6 |
COMP |
2007-06-29 17:00 |
Hokkaido |
Hokkaido University |
Linear-Time Recognition of Tree Structures by Deterministic Linear Pushdown Tree Automata Akio Fujiyoshi (Ibaraki Univ.) COMP2007-30 |
In this paper, we introduce a deterministic linear pushdown tree automaton (deterministic L-PDTA) and some variations. I... [more] |
COMP2007-30 pp.93-99 |
WBS, IT, ISEC |
2006-03-16 09:20 |
Aichi |
Nagoya Univ. |
Data Compression Using Source Model Based on Antidictionary Tree Takahiro Ota (Pit-Nagano), Hiroyoshi Morita (UEC) |
Data compression method using source model based on the automaton used antidictionary coding is proposed. However, the a... [more] |
IT2005-87 ISEC2005-144 WBS2005-101 pp.135-140 |
SS |
2005-06-24 09:00 |
Nagano |
Shinshu Univ. Ohta-Kokusai-Kinenkan |
A Static Analysis using Tree Automata for XML Access Control Isao Yagi, Yoshiaki Takata, Hiroyuki Seki (NAIST) |
Recently, an access control for XML database is one of the key issues in
database security. Given an access control po... [more] |
SS2005-18 pp.1-6 |
COMP |
2005-03-18 09:50 |
Tokyo |
Tokyo Institute of Technology |
Equality between Recognizable Expression and Finite Tree Automaton Fumihiko Yamaguchi, Katsunori Yamasaki (Tokyo Univ. of Sci.) |
Tree structured data processing is actively desired because of recent spread of XML and so on.
Recognizable Expression... [more] |
COMP2004-75 pp.17-22 |
COMP |
2004-12-10 10:30 |
Chiba |
Toho University |
A String Expression for Recognizable Set Fumihiko Yamaguchi, Katsunori Yamasaki (Tokyo Univ. of Sci.) |
Tree is a widely used data structure. Moreover, data processing in tree structure is actively desired because of recent ... [more] |
COMP2004-52 pp.1-6 |
SS |
2004-08-02 13:00 |
Hokkaido |
Future University Hakodate |
N/A Hideto Kasuya (Aichi Prefectural Univ.), Masahiko Sakai, Kiyoshi Agusa (Nagoya Univ.) |
Needed redexes whose reduction yield is a normalizing strategy are not decidable in higher-order rewrite systems as well... [more] |
SS2004-6 pp.1-6 |