【明日,明後日および明々後日の講演会のリマインダーです】
皆様,
2月28日(水)~3月1日(木),東工大にて両日16:30からSakarovitch先生による連続講演会があります.
水曜と木曜で会場が異なりますのでご注意ください.
3月2日(金)にも東大にて13:30からSakarovitch先生の講演会が開催されます.
参加のご検討,どうぞよろしくお願いします.
秋田大学 数理科学コース 新屋良磨
> On Feb 9, 2018, at 9:04, 新屋良磨(秋田大) <ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp>> wrote:
>
> (重複で受け取られた方はご容赦ください)
> 皆様,
>
> 秋田大の新屋です.
>
> 2月28日〜3月1日の東工大でのJacques Sakarovitch先生の連続講演会について,開催時間が変更されましたので,
> 概要を改めて再通知させていただきます.
>
&…
[View More]gt; 同日に東工大にて行われるプログラミング研究会と時間が重なっていたため,開始時刻を遅らせて
> Lecture/Seminar ともに16:30からの開始とさせていただきました.*会場は変更ありません.
>
>
> ========== Lecture ==========
> Time:
> 16:30 ~ 17:30, February 28, 2018 (Wed.)
>
>
> Venue:
> Room W935, West Bldg. 9, Tokyo Institute of Technology (Ookayama Campus)
> 東京工業大学大岡山キャンパス 西9号館 W935講義室 (西9号館東側(芝生スロープ側)入口を入って階段を1階上がって左側)
>
>
> Title:
> Automata and expressions
>
> Jacques Sakarovitch
> CNRS / Paris Diderot University and Telecom ParisTech
>
>
> Abstract:
> Not many results in Computer Science are recognised to be as basic and
> fundamental as Kleene Theorem. It states the equality of two sets of
> objects that we now call languages.
>
> In this lecture, I propose a slight change of focus on this result and show
> how it is mainly the combination of two families of algorithms:
> algorithms that transform an automaton into an expression on one hand
> and algorithms that build an automaton from an expression on the other.
>
> The first purpose is to compare the results of these algorithms,
> in order to understand they are indeed not so different.
> And also to devise means to keep these results as small as possible.
>
> The second benefit of isolating this part of Kleene Theorem is to allow
> its extension much beyond languages: to subsets of arbitrary monoids
> first, and then, with some precaution, to subsets with multiplicity,
> that is, to formal power series.
> ===========================
>
>
> ========== Seminar ==========
> Time:
> 16:30 ~ 17:30, March 1, 2018 (Thu.)
>
>
> Venue:
> Multi-Purpose Digital Hall, West Bldg. 9, Tokyo Institute of Technology (Ookayama Campus)
> 東京工業大学大岡山キャンパス 西9号館 ディジタル多目的ホール (西9号館東側(芝生スロープ側)入口を入ってすぐ)
>
>
> Title:
> Conjugacy and equivalence of weighted automata
>
> Jacques Sakarovitch
> CNRS / Paris Diderot University and Telecom ParisTech
>
>
> Abstract:
> As a main thread of this talk, I present the proof of the following result:
>
> If two regular languages $L$ and $K$ have the same generating
> functions, that is, for every integer $n$ they have the same number of
> words of length $n$, there exists a rational bijection realised by a
> letter-to-letter transducer that maps $L$ onto $K$.
>
> This statement is a consequence of a refinement of the decidability of
> the equivalence of two automata with multiplicity in $N$. It gives us
> the opportunity to review first the basic definitions and results on
> weighted finite automata, and second to revisit the `classical' theory
> of reduction of automata with two notions borrowed to symbolic
> dynamics: conjugacy and the Finite Equivalence Theorem.
> ===========================
>
>
> 大岡山キャンパスまでの行き方は以下をご覧ください:
> https://www.titech.ac.jp/maps/ <https://www.titech.ac.jp/maps/>
> 西9号館までの行き方は
> http://www.dst.titech.ac.jp/outline/facility/hall.html <http://www.dst.titech.ac.jp/outline/facility/hall.html>
> の中の地図をご覧ください。
>
> 以上,どうぞよろしくお願いします.
>
> 秋田大学 数理科学コース 新屋良磨 ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp>
> (共催:東京工業大学 情報理工学院 鹿島亮)
> Begin forwarded message:
>
> From: "新屋良磨(秋田大)" <ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp>>
> Subject: [jssst-ppl] Talk by Prof. Jacques Sakarovitch (March 2, 2018)
> Date: February 16, 2018 12:14:47 JST
> To: logic-ml(a)fos.kuis.kyoto-u.ac.jp <mailto:logic-ml@fos.kuis.kyoto-u.ac.jp>, jssst-ppl(a)fos.kuis.kyoto-u.ac.jp <mailto:jssst-ppl@fos.kuis.kyoto-u.ac.jp>
>
> (重複で受け取られた方はご容赦ください)
> 皆様,
>
> 秋田大学の新屋です.
>
> 以下の要領で3/2(金)に東大にてJacques Sakarovitch先生の講演会が開催されます.
>
> なお,前日(2/28~3/1)の東工大でのSakarovitch先生の連続講演会とは講演内容が別の
> 新規なものとなっております.どうぞふるってご参加ください.
>
> 秋田大学 数理科学コース 新屋良磨 ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp>
>
> ==========
> Time:
> 1:30pm, March. 2, 2018
>
>
> Venue:
> Room 236, East Building of Department of Chemistry, Faculty of Science(化学東館), University of Tokyo
>
>
> Title:
> Mysteries and marvels of rational base numeration systems
>
> Jacques Sakarovitch
> CNRS / Paris Diderot University and Telecom ParisTech
>
>
> Abstract:
> The definition of numeration systems with rational base, in a joint
> work with S. Akiyama and Ch. Frougny (Israel J. Math., 2008),
> has allowed to make some progress in a number theoretic problem,
> by means of automata theory and combinatorics of words.
> At the same time, it raised the problem of understanding the
> structure of the sets of the representations of the integers in these
> systems from the point of view of formal language theory.
>
> At first sight, these sets look rather chaotic and do not fit well
> in the classical Chomsky hierarchy of languages. They all enjoy a
> property that makes them defeat, so to speak, any kind of iteration
> lemma. On the other hand, these sets also exhibit remarkable
> regularity properties.
>
> During the recent years, these regularities have been studied in a
> series of joint papers with my student V. Marsault. In particular, we
> have shown that periodic signatures are characteristic of the
> representation languages in rational base numeration systems and
> studied, jointly with S. Akiyama, a kind of autosimilarity property
> that also leads to the construction of Cantor-like sets.
>
> These languages still keep most of their mystery. The partial results
> which will be presented call for further investigations on the subject
> even stronger.
> ==========
> _______________________________________________
> jssst-ppl mailing list
> jssst-ppl(a)fos.kuis.kyoto-u.ac.jp <mailto:jssst-ppl@fos.kuis.kyoto-u.ac.jp>
> http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/jssst-ppl <http://www.fos.kuis.kyoto-u.ac.jp/cgi-bin/mailman/listinfo/jssst-ppl>
[View Less]
[Apologies for multiple copies]
Dear all,
Let me advertise our next ERATO MMSD project colloquium talk by Étienne
André and Bart Jacobs on 1 March, 16:00-. Please find the title and the
abstract below. You are all invited.
Sincerely,
--
Natsuki Urabe
urabenatsuki(a)is.s.u-tokyo.ac.jp
The University of Tokyo, ERATO MMSD
----
Thu 1 March 2018, 16:00–18:00
ERATO MMSD Takebashi Site Common Room 3
http://group-mmm.org/eratommsd/access.html
16:00–17:00
Étienne André (University Paris 13),
…
[View More]Parametric timed automata: theory and applications
Critical real-time systems must be formally verified to prevent any
undesired behavior. When some timing constants are known with only a
limited precision, traditional timed model-checking techniques may not
apply anymore.
We use here the formalism of parametric timed automata. Parametric timed
automata are very expressive, and decision problems are notoriously very
hard (in fact most interesting decision problems are undecidable). On the
one hand, we review decidability results, and propose new decidable
subclasses. On the other hand, we adopt a more pragmatic approach, and show
that parametric timed automata allow us to model and verify distributed
real-time systems; using the IMITATOR software, we derive best- and
worst-case execution times for a real-time system designed by Thales, and
subject to uncertainty in some tasks periods.
We also briefly report on recent techniques to speed-up the verification
time using abstractions, and on distributed parametric model checking.
17:00–18:00
Bart Jacobs (Radboud University),
Privacy and Security in Identity Management and Medical Research
This talk will given an overview of the ideas behind two practically
oriented security and privacy projects at Nijmegen, NL:
1. Attribute-based identity management via the IRMA platform, see
https://privacybydesign.foundation/en/
If interested, you can before the talk already install the IRMA app on your
(Android or iOS) phone and collect some attributes yourself.
2. Polymorphic encryption and Pseudonymisation for a large scale Parkinson
research study, see: https://pep.cs.ru.nl/
[View Less]
[Apologies for multiple copies]
Dear all,
Let me advertise our next ERATO MMSD project colloquium talk by Takeo
Uramoto on 22 February, 16:30-. Please find the title and the abstract
below. You are all invited.
Sincerely,
--
Natsuki Urabe
urabenatsuki(a)is.s.u-tokyo.ac.jp
The University of Tokyo, ERATO MMSD
-----
Thu 22 February 2018, 16:30–18:00
ERATO MMSD Takebashi Site Common Room 3
http://group-mmm.org/eratommsd/access.html
Takeo Uramoto (Tohoku University),
Recent developments in …
[View More]algebraic language theory
The purpose of this talk is to introduce a recent (2008~) active research
trend in algebraic language theory. This field, among other approaches to
formal languages, is characterized by its methodology: one reduces
combinatorial / logical problems on formal languages (say, regular
languages) into some tractable problems on algebraic structures (resp.,
finite semigroups). Recent works in the last decade shed new lights on this
field (or its methodology) from the viewpoint of Stone-type duality
theorem; and most importantly, indicated several new research directions
extending classical frameworks. In this talk, based on our own works, we
introduce this research trend (and its background motivation) and then
carefully discuss its possible future directions.
[View Less]
(重複で受け取られた方はご容赦ください)
皆様,
秋田大学の新屋です.
以下の要領で3/2(金)に東大にてJacques Sakarovitch先生の講演会が開催されます.
なお,前日(2/28~3/1)の東工大でのSakarovitch先生の連続講演会とは講演内容が別の
新規なものとなっております.どうぞふるってご参加ください.
秋田大学 数理科学コース 新屋良磨 ryoma(a)math.akita-u.ac.jp <mailto:ryoma@math.akita-u.ac.jp>
==========
Time:
1:30pm, March. 2, 2018
Venue:
Room 236, East Building of Department of Chemistry, Faculty of Science(化学東館), University of Tokyo
Title:
Mysteries and marvels of rational base numeration systems
Jacques Sakarovitch
CNRS / …
[View More]Paris Diderot University and Telecom ParisTech
Abstract:
The definition of numeration systems with rational base, in a joint
work with S. Akiyama and Ch. Frougny (Israel J. Math., 2008),
has allowed to make some progress in a number theoretic problem,
by means of automata theory and combinatorics of words.
At the same time, it raised the problem of understanding the
structure of the sets of the representations of the integers in these
systems from the point of view of formal language theory.
At first sight, these sets look rather chaotic and do not fit well
in the classical Chomsky hierarchy of languages. They all enjoy a
property that makes them defeat, so to speak, any kind of iteration
lemma. On the other hand, these sets also exhibit remarkable
regularity properties.
During the recent years, these regularities have been studied in a
series of joint papers with my student V. Marsault. In particular, we
have shown that periodic signatures are characteristic of the
representation languages in rational base numeration systems and
studied, jointly with S. Akiyama, a kind of autosimilarity property
that also leads to the construction of Cantor-like sets.
These languages still keep most of their mystery. The partial results
which will be presented call for further investigations on the subject
even stronger.
==========
[View Less]
みなさま、
3月に金沢にて開催予定の
Second Workshop on Mathematical Logic and its Applications
につきまして、現在参加登録を受け付けております。
ご参加いただける方は2月18日までに参加登録をいただけますと幸いです。
ご検討の程よろしくお願い致します。
横山啓太
CALL FOR PARTICIPATION
Second Workshop on Mathematical Logic and its Applications
Kanazawa, Japan
5 - 9 March 2018
http://www.jaist.ac.jp/is/labs/ishihara-lab/mla2018/
Description
-----------
The workshop brings together researchers of mathematical logic and
its related areas, and would provide a forum for interplay between
these …
[View More]areas. This workshop will be held as a part of the JSPS
Core-to-Core Program "Mathematical Logic and its Applications",
which is led by Japan Advanced Institute of Science and Technology
(JAIST) in cooperation with several institutes both in Japan and
abroad. We welcome submissions from anyone, not restricted to the
members of the project, within the scope described below.
Scope
------
Includes (but not limited to) the following topics and their application:
* Intuitionistic logic
* Type theory
* Proof theory
* Constructive analysis/topology
* Program extraction
* Reverse mathematics
* Computable analysis/topology
* Recursion theory (Computability theory)
* Non-classical logic
* Computational complexity
Invited speakers
-----------------
* Andrew Arana (Universite Paris 1)
* Urlich Berger (Swansea University)
* Douglas Bridges (University of Canterbury)
* Laura Crosilla (University of Birmingham)
* Akitoshi Kawamura (Kyushu University)
* Hidenori Kurokawa (Kanazawa University)
* Maria Emilia Maietti (University of Padova)
* Norbert Preining (Accelia Inc.)
* Helmut Schwichtenberg (LMU Muenchen)
* Kazushige Terui (Kyoto University)
* Wim Veldman (Radboud University Nijmegen)
* Andreas Weiermann (Ghent University)
Registration (deadline: 18 February 2018)
------------------------
Registrations after the deadline, or participantions without registrations
will be accepted as much as possible.
But if you wish to have an abstract booklet or to join the banquet,
please register before the deadline from below.
Programme Committee
--------------------
* Ryota Akiyoshi (Waseda, Japan)
* Josef Berger (LMU Muenchen, Germany)
* Makoto Fujiwara (Waseda, Japan)
* Tatsuji Kawai (Padova, Italy)
* Katsuhiko Sano (Hokkaido, Japan)
* Keita Yokoyama (JAIST, Japan)
* Martin Ziegler (KAIST, Korea)
Organizers
-----------------
* Ryota Akiyoshi (Waseda, Japan)
* Makoto Fujiwara (Waseda, Japan)
* Tatsuji Kawai (Padova, Italy)
* Takako Nemoto (JAIST, Japan)
* Keita Yokoyama (JAIST, Japan)
Contact address: organizers-jsps2nd(a)jaist.ac.jp
--
Keita Yokoyama
y-keita(a)jaist.ac.jp
[View Less]