Add to ORKGThis compilation is the complete set of final projects from the MATH 821- Combinatoric
In order to produce efficient parallel programs, optimizing compilers need to include an analysis of...
AbstractWe prove that each context-free language possesses a test set of size O(m6), where m is the ...
Abstract. In this paper, the density of a language is the function that returns, for each n, the num...
Title from first page of PDF file (viewed January 3, 2011)Includes bibliographical references (p. 26...
International audienceThis paper presents a survey on length distributions of regular languages. The...
Abstra t. This paper presents a survey on length distributions of regular languages. The a ent is o...
Contains fulltext : 75839.pdf (publisher's version ) (Open Access)Ninth Symposium ...
AbstractThis work deals with questions regarding to what extent regularity-preserving language opera...
In the realm of descriptional complexity, systems are compared on the basis of their size. Here, we ...
We consider two formalisms for representing regular languages: constant height pushdown automata and...
AbstractGiven two regular languages R1 and R2 with R1⊆R2, one can effectively determine the number o...
We consider the number of queries required to identify a regular set given an oracle for the set and...
Background: Software project size is often used as independent variable for predicting dependent var...
Contains fulltext : 75339.pdf (publisher's version ) (Open Access)28 p
Abstract. This work is concerned with regular languages defined over large alphabets, either infinit...
In order to produce efficient parallel programs, optimizing compilers need to include an analysis of...
AbstractWe prove that each context-free language possesses a test set of size O(m6), where m is the ...
Abstract. In this paper, the density of a language is the function that returns, for each n, the num...
Title from first page of PDF file (viewed January 3, 2011)Includes bibliographical references (p. 26...
International audienceThis paper presents a survey on length distributions of regular languages. The...
Abstra t. This paper presents a survey on length distributions of regular languages. The a ent is o...
Contains fulltext : 75839.pdf (publisher's version ) (Open Access)Ninth Symposium ...
AbstractThis work deals with questions regarding to what extent regularity-preserving language opera...
In the realm of descriptional complexity, systems are compared on the basis of their size. Here, we ...
We consider two formalisms for representing regular languages: constant height pushdown automata and...
AbstractGiven two regular languages R1 and R2 with R1⊆R2, one can effectively determine the number o...
We consider the number of queries required to identify a regular set given an oracle for the set and...
Background: Software project size is often used as independent variable for predicting dependent var...
Contains fulltext : 75339.pdf (publisher's version ) (Open Access)28 p
Abstract. This work is concerned with regular languages defined over large alphabets, either infinit...
In order to produce efficient parallel programs, optimizing compilers need to include an analysis of...
AbstractWe prove that each context-free language possesses a test set of size O(m6), where m is the ...
Abstract. In this paper, the density of a language is the function that returns, for each n, the num...