Finite automata (FA's) are of fundamental importance in theory and in applications. The
following basic minimization problem is studied: Given a DFA (deterministic FA), find a …

For many problems arising in the setting of graph querying (such as finding semantic
associations in RDF graphs, exact and approximate pattern matching, sequence alignment …

The theory of finite automata on finite stings, infinite strings, and trees has had a dis
tinguished history. First, automata were introduced to represent idealized switching circuits …

Finite automata are probably best known for being equivalent to right-linear context-free
grammars and, thus, for capturing the lowest level of the Chomsky-hierarchy, the family of …

We investigate the descriptional complexity of operations on finite and infinite regular
languages over unary and arbitrary alphabets. The languages are represented by …

Regular Expressions: New Results and Open Problems Page 1 Journal of Automata,
Languages and Combinatorics u (v) w, x–y Otto-von-Guericke-Universität Magdeburg Regular …

Descriptional complexity is the study of the conciseness of the various models representing
formal languages. The state complexity of a regular language is the size, measured by the …

In this paper we give the cost, in terms of states, of some basic operations (union,
intersection, concatenation, and Kleene star) on regular languages in the unary case (where …

We design temporal description logics (TDLs) suitable for reasoning about temporal
conceptual data models and investigate their computational complexity. Our formalisms are …

Widespread use of string solvers in the formal analysis of string-heavy programs has led to a
growing demand for more efficient and reliable techniques which can be applied in this …