In this paper we study the subset construction that transforms nondeterministic finite automata (NFA) to deterministic finite automata (DFA). It is well known that given a n-state NFA, the subset construction algorithm produces a 2-state DFA in the worst case. It has been shown that given n,m (n < m ≤ 2), there is a n-state NFA N such that the minimal DFA recognizing L(N ) has m states. However...

A finite automaton can be either deterministic (DFA) or nondeterministic (NFA). An automaton-based task is in general more efficient when performed with a DFA rather than an NFA. For any NFA there equivalent that generated by the classical Subset Construction algorithm. When, however, large may transformed into series of actions operating directly on NFA, unnecessarily expensive computation, as...

Finite-state transducers play an important role in natural language processing. They provide a model for text and speech, as well as transformations of them. In order to reduce the complexity of their application, deterministic and minimal transducers are required. This essay introduces a particular type of finite-state transducers, subsequential string-to-weight transducers, and presents algor...

Planning and acting in a dynamic environment is a challenging task for an autonomous agent, especially in the presence of uncertain and exogenous effects, a large number of states, and a long-term planning horizon. In this thesis, we approach the problem by considering algorithms that interleave planning for the current state and execution of the taken decision. The main challenge of the agent ...

Durational Action Timed Automata (DATA) is a semantic model for expressing the behavior of real time systems where actions have durations. In this paper, we propose an approach for translating a DATA structure to a corresponding deterministic one. For this purpose, a meta-model of DATA model and a transformation grammar are defined. Programs are written in Python language and implemented under ...

We consider weighted finite automata over strong bimonoids, where these weight structures can be considered as semirings which might lack distributivity. Then, in general, the well-known run semantics, initial algebra semantics, and transition semantics of an automaton are different. We prove an algebraic characterization for the initial algebra semantics in terms of stable finitely generated s...

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

In many applications of speech and language processing, we generate intermediate results in the form of a lattice on which we apply finite-state operations. For example, we might POS tag the words in an ASR output lattice as an intermediate stage for language modeling. Currently, we have to convert the lattice into n-best scoring sub-lattices (one sub-lattice per unique input sequence), analyze...

In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, little of this theory has been reduced to practice. This is in contrast with model-checking theory, which has led to industrial development and use of formal verification tools. We see two main reasons for the lack of pra...