Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Unary regular languages"”.

  1. QUANTUM AND TRANSLUCENT PARADIGMS IN AUTOMATA THEORY: A STUDY ON COMPUTATIONAL CAPABILITIES

    … descriptional power, with particular emphasis on unary language recognition. Frameworks for recognising unary languages by Latvian QFAs (LQFAs) and QFAs with Control Language (QFCs) are developed. Moreover, decidability questions related to periodicity in measure-once QFAs, measure-many QFAs, …

    milano Repository record for QUANTUM AND TRANSLUCENT PARADIGMS IN AUTOMATA THEORY: A STUDY ON COMPUTATIONAL CAPABILITIES (opens in a new tab)