| 1. |
Takeo Uramoto, A short essay on the interplay between algebraic language theory, galois theory, and class field theory: comparing physics and theory of computation, 数理解析研究所講究録, 2022.12. |
| 2. |
Yusuke Imoto, Naoya Yamanaka, Takeo Uramoto, Masato Tanaka, Masaki Fujikawa, Naoto Mitsume, Fundamental theorem of matrix representations of hyper-dual numbers for computing higher-order derivatives, JSIAM Letters, 29-32, 2020.06. |
| 3. |
Formulation for an Ogden-type hyperelastic analysis with hyper dual numbers and its performance evaluation. |
| 4. |
Takeo Uramoto, Semi-galois Categories II: An arithmetic analogue of Christol's theorem, Journal of Algebra, 508, 15, 539-568, 2018.08. |
| 5. |
On an unsuccessful construction of semi-galois categories. |
| 6. |
Takeo Uramoto, Semi-galois Categories I: The Classical Eilenberg Variety Theory, Proceedings of Logic in Computer Science, 2016, 545-554, 2016.07. |
| 7. |
Takeo Uramoto, Canonical finite models of Kleene algebra with tests, JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 10.1016/j.jlamp.2015.11.001, 85, 4, 595-616, 2016.06, Kleene algebra with tests (KAT) was introduced by Kozen as an extension of Kleene algebra (KA). So far, the decidability of equational formulas (p = q) and Horn formulas (boolean AND(i)p(i) =q(i) -> p = q) in KAT has been investigated by several authors. Continuing this line of research, the current paper studies the decidability of existentially quantified equational formulas there exists q epsilon P.(p = q) in KAT, where P is a fixed collection of KAT terms and plays a role as a parameter of this decision problem. To design a systematic strategy of deciding problems of this form, given in this paper is an effective procedure of constructing from each KAT term p a finite KAT model K(p) that will be called the canonical finite model of the KAT term p. Applications of this construction are presented, proving the decidability of there exists q epsilon P.(p = q) for several non-trivial P. (C) 2015 Elsevier Inc. All rights reserved.. |
| 8. |
Variety theory of regular languages and propositional dynamic logic. |
| 9. |
Takeo Uramoto, A modified completeness theorem of KAT and decidability of term reducibility , Proceedings of Relational and Algebraic Methods in Computer Science, 2014, 83-100, 2014.04. |
