Sökning: "Finite state automata"

Visar resultat 1 - 5 av 24 avhandlingar innehållade orden Finite state automata.

1. 1. On Supervisor Synthesis via Active Automata Learning

   Författare :Ashfaq Hussain Farooqui; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Supervisory control theory; Finite-state machines; Active learning; Model learning; Automata learning; Discrete-event systems;

   Sammanfattning : Our society's reliance on computer-controlled systems is rapidly growing. Such systems are found in various devices, ranging from simple light switches to safety-critical systems like autonomous vehicles. In the context of safety-critical systems, safety and correctness are of utmost importance. LÄS MER

3. 2. Automatic Detection of Grammar Errors in Primary School Children's Texts. A Finite State Approach

   Författare :Sylvana Sofkova Hashemi; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; grammar errors; spelling errors; punctuation; children s writing; Swedish; language checking; light parsing; finite state technology;

   Sammanfattning : This thesis concerns the analysis of grammar errors in Swedish texts written by primary school children and the development of a finite state system for finding such errors. Grammar errors are more frequent for this group of writers than for adults and the distribution of the error types is different in children's texts. LÄS MER

4. 3. A Seamless Framework for Control Function Generation

   Författare :Sajed Miremadi; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Discrete Event Systems; Supervisory Control Theory; Deterministic Finite Automata; Binary Decision Diagrams; Extended Finite Automata;

   Sammanfattning : As we progress in time, the dependence and inseparability of our daily lives to computer and software systems grow rapidly; some transparent to many of us. It is therefore crucial to have efficient design of correct and well-functioning computer and software systems. LÄS MER

5. 4. Translation as Linear Transduction : Models and Algorithms for Efficient Learning in Statistical Machine Translation

   Författare :Markus Saers; Joakim Nivre; Anna Sågvall Hein; Dekai Wu; Kevin Knight; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; linear transduction; linear transduction grammar; inversion transduction; zipper finite-state automaton; zipper finite-state transducer; formal language theory; formal transduction theory; translation; automatic translation; machine translation; statistical machine translation; Computational linguistics; Datorlingvistik; Language technology; Språkteknologi; Computational Linguistics; Datorlingvistik;

   Sammanfattning : Automatic translation has seen tremendous progress in recent years, mainly thanks to statistical methods applied to large parallel corpora. Transductions represent a principled approach to modeling translation, but existing transduction classes are either not expressive enough to capture structural regularities between natural languages or too complex to support efficient statistical induction on a large scale. LÄS MER

7. 5. Compositional Approaches in Supervisory Control with Application to Automatic Generation of Robot Interlocking Policies

   Författare :Hugo Flordal; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; nonblocking; finite state automata; verification; controllability; Discrete event systems; model reduction; synthesis; interlocking; supervisory control;

   Sammanfattning : The work presented in this thesis concerns verification and synthesis in the Ramadge and Wonham supervisory control framework. Supervisory control constitutes a formal framework for the design of supervisors for discrete event systems. LÄS MER