01/06/2022

PhD Position in Information and Communication Technology, Early stage researcher


  • ORGANISATION/COMPANY
    Tallinn University of Technology
  • RESEARCH FIELD
    Computer science
  • RESEARCHER PROFILE
    First Stage Researcher (R1)
  • APPLICATION DEADLINE
    30/06/2022 23:00 - Europe/Brussels
  • LOCATION
    Estonia › Tallinn
  • TYPE OF CONTRACT
    Temporary
  • JOB STATUS
    Full-time
  • HOURS PER WEEK
    40
  • OFFER STARTING DATE
    01/09/2022

OFFER DESCRIPTION

Tallinn University of Technology, School of Information Technologies, Department of Software Science offers a 4-year PhD position in the field of information and communication technology.

Proposed doctoral thesis topic: "Theory and Practice of Symbolic Automata".

Supervisors: Professor Pawel Sobocinski and Senior Researcher Hellis Tamm

Abstract

Symbolic finite automata extend classical automata by allowing infinite alphabets. In these automata predicates over infinite alphabets, which form a Boolean algebra, serve as labels of transitions. Symbolic automata have been studied intensively in recent years, because they solve some practical problems for which classical finite automata are unsuitable. However, the study of symbolic automata is a young field and much work is still to be done.

Description

This PhD project explores theoretical as well as practical aspects of symbolic automata. The project will advance symbolic automata research, studying classes of finite automata (e.g. residual automata, reversible automata, boolean automata) in the symbolic setting [3,4], especially focussing on automata learning [5].

References

[1] D’Antoni, L., Veanes, M.: The power of symbolic automata and transducers. CAV 2017. doi: 10.1007/978-3-319-63387-9_3 [2] D'Antoni, L., Veanes, M.: Automata modulo theories. Commun. ACM, 64, 5, 86-95, 2021, doi: 10.1145/3419404

[3] Stanford, C., Veanes, M., Bjørner, N.: Symbolic Boolean derivatives for efficiently solving extended regular expression constraints. PLDI 2021, doi: 10.1145/3453483.3454066

[4] Tamm, H., Veanes, M.: Theoretical aspects of symbolic automata. SOFSEM 2018. doi: 10.1007/978-3-319-73117-9_30

[5] Argyros, G., D'Antoni L. The learnability of symbolic automata. CAV 2018. doi: 10.1007/978-3-319-96145-3_23

The project will form a part of an ongoing Estonian Research Council project PRG1210, Automata in Learning, Interaction and Concurrency (ALICE), and will also involve collaboration with Margus Veanes, Microsoft Research (Redmond). Applicants should be highly motivated and ideally have some previous knowledge of automata theory.

More Information

Offer Requirements

  • REQUIRED EDUCATION LEVEL
    Computer science: Master Degree or equivalent
  • REQUIRED LANGUAGES
    ENGLISH: Good

Skills/Qualifications

Applicants should fulfil the following requirements:

  • a master’s degree in computer science
  • Applicants should be highly motivated and ideally have some previous knowledge of automata theory

Specific Requirements

The information for the PhD admission is available at TalTech’s web-page: https://www.taltech.ee/en/phd-admission

Required application documents:

  • CV
  • Motivation letter
  • Degree certificates
  • Copy of the passport

Map Information

Job Work Location Personal Assistance locations
Work location(s)
1 position(s) available at
Tallinn University of Technology
Estonia
Tallinn
12618
Akadeemia tee 15a

Open, Transparent, Merit based Recruitment procedures of Researchers (OTM-R)

Know more about it at Tallinn University of Technology

Know more about OTM-R

EURAXESS offer ID: 793205

Disclaimer:

The responsibility for the jobs published on this website, including the job description, lies entirely with the publishing institutions. The application is handled uniquely by the employer, who is also fully responsible for the recruitment and selection processes.

 

Please contact support@euraxess.org if you wish to download all jobs in XML.