Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Takeo Uramoto

dblp:144/1331 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2016
0000-0002-6527-1093ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 33% Mathematical optimization · 33% Logic in computer science · 33%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › constrained optimization
duality theory
0.212016
Semi-galois Categories I: The Classical Eilenberg Variety Theory · LICS 2016
Logic in computer science › algebraic logic
stone duality
0.212016
Semi-galois Categories I: The Classical Eilenberg Variety Theory · LICS 2016

Methods — techniques the papers use, named apart from their topics

galois theory · 0.2category theory · 0.2
YearPublicationVenuePosition
2016 Semi-galois Categories I: The Classical Eilenberg Variety Theory
abstract
Recently, Eilenberg's variety theorem was reformulated in the light of Stone's duality theorem. On one level, this reformulation led to a unification of several existing Eilenberg-type theorems and further generalizations of these theorems. On another level, this reformulation is also a natural continuation of a research line on profinite monoids that has been developed since the late 1980s. The current paper concerns the latter in particular. In this relation, this paper introduces and studies the class of semi-galois categories, i.e. an extension of galois categories; and develops a particularly fundamental theory concerning semi-galois categories: That is, (I) a duality theorem between profinite monoids and semi-galois categories; (II) a coherent duality-based reformulation of two classical Eilenberg-type variety theorems due to Straubing [30] and Chaubard et al. [10]; and (III) a Galois-type classification of closed subgroups of profinite monoids in terms of finite discrete cofibrations over semi-galois categories.
Takeo Uramoto
LICS1
2014 A Modified Completeness Theorem of KAT and Decidability of Term Reducibility
Takeo Uramoto
RAMiCS1