DLT Satellite Workshop in Kyoto
In honour of Masami Ito's KIJU and Pál Dömösi's 75th birthday
   
PROGRAM
   
   
  Wednesday, September 5, 2018 
   
12:10 - 12:40 Registration
12:40 - 12:50 Opening
12:50- 13:15 Professor Pál Dömösi's Speech:
Old Stories on Context-Free Languages and Primitive Words.
13:15 - 14:15 INVITED TALK
Volker Diekert (University of Stuttgart): 
Word Equations in SL(s,Z)
14:15 - 14:45 Arseny Shur (Ural Federal University):
Words Separation and Positive Identities in Symmetric Groups
14:45 - 15:00 Coffee break
   
15:00 - 15:30 Jiryo Komeda (Kanagawa Institute of Technology):
The Quotient of a Numerical Semigroup with High Conductor by Two or Three
15:30 - 16:00 Bundit Pibaljommee (Khon Kaen University):
Generalized Superposition of Linear Tree Languages and Products of Linear Tree Languages
16:00 - 16:30 Mikhail Volkov (Ural Federal University):
Slowly Synchronizing Automata with Idempotent Letters of Low Rank
   
17:10 - 19:00 Welcome Party
   
   
  Thursday, September 6, 2018 
   
9:00 - 9:30 Munehiro Iwami (Shimane University):
Syntactic Unification over Rational Terms Revisited
9:30 - 10:00 Thawhat Changphas (Khon Kaen University):
Equivalent Variaties of Multialgebras
10:00 - 10:30 Benedek Nagy (Eastern Mediterranean University):
On the NP-completeness of the Word Problem for Permutation Grammars
10:30 - 10:45 Coffee break
   
10:45 - 11:45 INVITED TALK
Galina Jirásková (Slovak Academy of Sciences):
Deterministic blow-ups of nondeterministic finite automata
 11:45 - 12:15 Jozef Jirásek (Pavol Jozef Šafárik University):
Deterministic Blow-ups of Binary Nondeterministic Finite Automata (work in progress)
12:15 - 13:15 Lunch
   
13:15 - 13:45 Nelma Moreira (University of Porto):
Conversions from Regular Expressions to Automata: a Taxonomy and Some Average Size Results
13:45- 14:15 Michal Hospodár (Mathematical Institute, Slovak Academy of Sciences):
The Range of State Complexities of Languages Resulting from the Cut Operation
 14:15 - 14:45 Michal Hospodár (Mathematical Institute, Slovak Academy of Sciences):
Nondeterministic Complexity of Power and Positive Closure on Subclasses of Convex Languages
14:45 - 15:00 Information about Kyoto
15:00 - 15:10 Coffee break
   
15:10 - 15:40 Dávid Nagy (University of Debrecen):
Different Types of Search Algorithms for Rough Sets Using Barabasi-Albert and Erdős-Rényi Graphs
 15:40 - 16:10 Giuseppe Pirillo (Universitŕ degli Studi di Firenze):
On a Result of a Student of Erdős
19:00 -- Workshop Banquet
  Friday, September 7, 2018 
   
9:00 - 9:30 Maksims Dimitrijevs (University of Latvia):
Verifying Every Language in Constant Space
9:30 - 10:00 Giuseppe Pirillo (Universitŕ degli Studi di Firenze):
The Carboncettus Quasi-Regular Octagon and Other Polygons
10:00 - 10:30 Szilárd Fazekas (Akita University):
Clusters of Distinct Square Roots
10:30 - 10:45 Coffee break
   
10:45 - 11:15 Tomoko Adachi (Toho University):
Magic Cube and Its Application to Secret Sharing Scheme
11:15 - 11:45 Carolin Hannusch (University of Debrecen):
A Cryptosystem Based on a New Class of Error-Correcting Codes
11:45 - 12:15 Géza Horváth (University of Debrecen):
Security Analysis of Stream Ciphers: DH3 vs. OTP
12:15 - 13:15 Lunch
   
13:15 - 13:45 Friedrich Otto (Charles University):
On Two-Sided Locally Testable Languages
13:45- 14:15 Kenichi Morita (Hiroshima University):
Reversible Turing Machines in a Simple Reversible Triangular Cellular Automaton
 14:15 - 14:45 Attila Egri-Nagy (Akita International University):
Reversible Computing and Algebraic Compositionality
14:45 - 15:00 Coffee break
   
15:00 - 15:30 F. Masafumi Toyama (Kyoto Sangyo University):
Additive Decomposition of Iterative Quantum Search Operations and Its Significance for Quantum Searches
15:30 - 16:00 F. Masafumi Toyama (Kyoto Sangyo University):
Weak-Measurement Experiments on Qubits of IBM Cloud Q
16:00 - 16:30 Professor Masami Ito's Speech:
A Cryptosystem Based on Automaton
16:30 - 16:40 Closing