Travelled to:1 × Canada
1 × Denmark
1 × Germany
1 × USA
1 × United Kingdom
2 × Spain
Collaborated with:Y.Kaji T.Takai Y.Ishihara T.Kasami R.Yoshinaka H.Ohsaki Y.Fujinaka K.Hashimoto R.Sawada T.Fujiwara M.Higuchi O.Shirakawa M.Fujii
Talks about:languag (3) rewrit (3) transduc (2) recogniz (2) preserv (2) system (2) specif (2) finit (2) tree (2) term (2)
Person: Hiroyuki Seki
DBLP: Seki:Hiroyuki
Contributed to:
20132010
200320022000
1993
1992Wrote 7 papers:
- LATA-2013-HashimotoSISF #bottom-up #transducer
- Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers (KH, RS, YI, HS, TF), pp. 335–346.
- LATA-2010-YoshinakaKS #context-free grammar #multi
- Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages (RY, YK, HS), pp. 596–607.
- RTA-2003-OhsakiST
- Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism (HO, HS, TT), pp. 483–498.
- RTA-2002-SekiTFK #term rewriting
- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property (HS, TT, YF, YK), pp. 98–113.
- RTA-2000-TakaiKS #effectiveness #finite #linear #term rewriting
- Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability (TT, YK, HS), pp. 246–260.
- RE-1993-IshiharaSK #dependence #natural language #specification #using
- A translation method from natural language specifications into formal specifications using contextual dependencies (YI, HS, TK), pp. 232–239.
- CAV-1992-HiguchiSSFK #communication #finite #invariant #state machine #verification
- A Verification Procedure via Invariant for Extended Communicating Finite-State Machines (MH, OS, HS, MF, TK), pp. 384–395.