We consider two formalisms for representing regular languages: constant height pushdown automata and straight line programs for regular expressions. We constructively prove that their sizes are polynomially related. Comparing them with the sizes of finite state automata and regular expressions, we obtain optimal exponential and double exponential gaps, i.e., a more concise representation of regular languages
Abstract. Regular expressions with numerical constraints are an exten-sion of regular expressions, a...
ABSTRACT. We consider the construction of finite automata from their corresponding regular expressio...
AbstractThis work deals with questions regarding to what extent regularity-preserving language opera...
We consider two formalisms for representing regular languages: constant height pushdown automata and...
In the realm of descriptional complexity, systems are compared on the basis of their size. Here, we ...
AbstractWe consider two formalisms for representing regular languages: constant height pushdown auto...
We introduce and study the notion of constant length queue automata, as a formalism for representing...
Non-self-embedding grammars, constant-height pushdown automata and 1-limited automata are restrictio...
It is well known that the class of regular languages coincides with the class of languages recognize...
Abstract. The problem of converting deterministic finite automata into (short) regular expressions i...
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene...
AbstractIn this paper, we study the succinctness of regular expressions (REs) extended with interlea...
This thesis analyzes the descriptional power of finite automata, regular expressions, pushdown auto...
Regular languages are one of the oldest, well-known topics in formal language theory. Indeed, it has...
Abstract. An original algorithm for transformation of finite automata to regular expressions is pres...
Abstract. Regular expressions with numerical constraints are an exten-sion of regular expressions, a...
ABSTRACT. We consider the construction of finite automata from their corresponding regular expressio...
AbstractThis work deals with questions regarding to what extent regularity-preserving language opera...
We consider two formalisms for representing regular languages: constant height pushdown automata and...
In the realm of descriptional complexity, systems are compared on the basis of their size. Here, we ...
AbstractWe consider two formalisms for representing regular languages: constant height pushdown auto...
We introduce and study the notion of constant length queue automata, as a formalism for representing...
Non-self-embedding grammars, constant-height pushdown automata and 1-limited automata are restrictio...
It is well known that the class of regular languages coincides with the class of languages recognize...
Abstract. The problem of converting deterministic finite automata into (short) regular expressions i...
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene...
AbstractIn this paper, we study the succinctness of regular expressions (REs) extended with interlea...
This thesis analyzes the descriptional power of finite automata, regular expressions, pushdown auto...
Regular languages are one of the oldest, well-known topics in formal language theory. Indeed, it has...
Abstract. An original algorithm for transformation of finite automata to regular expressions is pres...
Abstract. Regular expressions with numerical constraints are an exten-sion of regular expressions, a...
ABSTRACT. We consider the construction of finite automata from their corresponding regular expressio...
AbstractThis work deals with questions regarding to what extent regularity-preserving language opera...