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 20 of 60 for “"Regular Languages"”.
-
Reducibilities between Regular Languages
… of this masters thesis is to investigate when a regular set A is reducible to a regular set B in the following sense: A is automaton reducible to B if there is an automatic and injective function f mapping A to B. A is transducer reducible to B if there is a function f mapping A to B where f can …
-
Counting, Adding, and Regular Languages
… theory that both involve the study and use of regular languages. The first topic lies in the intersection of automata theory and additive number theory. We introduce a method of producing results in additive number theory, relying on theorem-proving software and an approximation technique. As …
-
Left Quotients by Regular Languages
… a foundational role, especially in the study of regular languages. This thesis studies the operation of left quotient by a regular language on several language families, in particular those accepted by deterministic classes of automata that are not closed under this operation. The effect of this …
-
Learning regular languages over large alphabets
Learning regular languages is a branch of machine learning, a domain which has proved useful in many areas, including artificial intelligence, neural networks, data mining, verification, etc. In addition, interest in languages defined over large and infinite alphabets has increased in recent years. …
-
Syntactic Complexities of Nine Subclasses of Regular Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We …
-
Foundations of Regular Languages for Processing RDF and XML
Die vorliegende Arbeit befasst sich mit der Komplexität und Optimierung von Problemen, die bei der Verwendung von regulären Sprachen für die web-basierte Datenverarbeitung entstehen. Die betrachteten Problemstellungen sind insbesondere durch Anwendungen motiviert die eines der folgenden zwei …
-
REGULAR LANGUAGES: TO FINITE AUTOMATA AND BEYOND - SUCCINCT DESCRIPTIONS AND OPTIMAL SIMULATIONS
È noto che i linguaggi regolari — o di tipo 3 — sono equivalenti agli automi a stati finiti. Tuttavia, in letteratura sono presenti altre caratterizzazioni di questa classe di linguaggi, in termini di modelli riconoscitori e grammatiche. Per esempio, limitando le risorse computazionali di modelli …
-
Modular Supervisory Control of a Flexible Manufacturing Unit using Regular Languages and Finite Deterministic Automata
Στην παρούσα διπλωματική εργασία θα παρουσιαστεί το μαθηματικό μοντέλο ενός ευέλικτου συστήματος παραγωγής το οποίο αποτελείται από τρείς ρομποτικούς βραχίονες, δύο μηχανές παραγωγής και τρείς μεταφορείς. Το σύστημα δύναται να κατεργαστεί δύο διαφορετικούς τύπους προϊόντων με διαφορετική διαδικασία …
-
Three topics in the theory of computing: Multi-resolution cellular automata, the Kolmogorov complexity characterization of regular languages, and hidden variables in Bayesian networks
… cellular automata (MRCA) simulator, how to prove languages are non-regular using Kolmogorov complexity, and how to show hidden variables are valuable in Bayesian networks.</p>
-
Distances Between Languages: Algorithms and Descriptional Complexity
… descriptional complexity of neighbourhoods of regular languages and the computational complexity of computing the distance between languages. Distance measures are defined on words to describe their similarity. These measures can be extended to languages, which are sets of words. We consider …
-
The Forbidden Pattern Approach to Concatenation Hierarchies
… the computability of the dot-depth of star-free regular languages. Here one has to determine for a given star-free regular language the minimal number of alternations between concatenation on one hand, and intersection, union, complement on the other hand. This question was first raised in 1971 …
-
Hypertrees: a study in language specification
… operation is presented. Grammars, automata and regular expressions are extended to this hierarchy. These are shown to be equivalent and the resulting languages are called regular. This leads to a hierarchy of regular languages on the hypertree hierarchy. These are projected onto the set of …
-
Expressiveness and Decidability of Weighted Automata and Weighted Logics
… of strings is also called a language, and the languages which can be described by finite automata are known as regular languages. Owing to their versatility, regular languages have received a great deal of attention over the years. Other formalisms were shown to be expressively equivalent to …
-
Structural properties of one-tape Turing machines.
… probabilistic computations recognize exactly regular languages whereas probabilistic and quantum Turing machines can recognize even non-regular languages.
-
Computation Widths for Alternating Finite Automata
… nondeterminism and parallelism for describing regular languages. Though AFAs describe the same set of languages as NFAs and DFAs (deterministic finite automata), they are capable of doing so in a very succinct way; in the extreme case exhibiting exponential savings in state complexity compared …
-
Software for Combinatorial Power Series
… one can find the generating functions for regular languages, compute the initial terms of a generating function, convert between generating function equations and recurrences, and find asymptotics. This thesis gives mathematical background, extensive documentation for Genfunlib, and …
-
Problems Related to Shortest Strings in Formal Languages
… language theory, studying shortest strings in languages, and variations thereof, can be useful since these strings can serve as small witnesses for properties of the languages, and can also provide bounds for other problems involving languages. For example, the length of the shortest string …
-
Supervisory Control Theory for Controlling Swarm Robotics Systems
… (specifications) to be defined as formal languages. In this thesis, regular languages are used. Regular languages, in the form of deterministic finite state automata, have already been widely applied for controlling swarm robotics systems, enabling a smooth transition from the ad-hoc …
-
Automaten und Logiken zur Beschreibung zeitabhängiger Systeme
… logic TL_Gamma is proved. Timed automata and the languages recognised by them, the so-called timed regular languages, are analysed in more detail. Several aspects are considered. A pumping lemma for timed automata is given, resulting in a formal proof that timed regular languages are not closed …
Page 1 of 3