| |
 |
|
|
Ullian, Joseph
Washington University
St. Louis, Missouri
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 9 of 9
reviews
|
|
|
|
|
|
|
|
On D0L systems with immigration
Honkala J. Theoretical Computer Science 120(2): 229-245, 1993. Type: Article
The kind of L system treated in this routine paper was introduced by Honkala and Salomaa. A D0L system with immigration, or ImD0L system, is a triple G = ( &Sgr; , h , B ) where &Sgr; is an alphabet,
|
Oct 1 1994 |
|
|
|
|
|
|
Extended regular expressions of arbitrary star degrees
Yoo H., Hashiguchi K. Theoretical Computer Science 97(2): 217-231, 1992. Type: Article
Operations that generalize Kleene star were introduced and studied by the authors in previous papers [1,2]. This paper extends the study to “star operators of degree ≥ 3.” The family of extended regular langu...
|
Jun 1 1993 |
|
|
|
|
|
|
Extended automata-like regular expressions of star degree at most (2,1)
Yoo H., Hashiguchi K. Theoretical Computer Science 88(2): 351-363, 1991. Type: Article
In a previous paper, the authors introduced the operation ** [1]. This paper introduces the “star operation of degree (2,1),” which is a generalization of **. The family of extended automata-like regular languages (...
|
Sep 1 1992 |
|
|
|
|
|
|
Extended regular expressions of star degree at most two
Hashiguchi K., Yoo H. Theoretical Computer Science 76(2-3): 273-284, 2001. Type: Article
Let n be greater than or equal to 1, and let E, Di, and Fi be sets of words. Then contains all words in E; whenever...
|
Jul 1 1991 |
|
|
|
|
|
|
Generation of invertible functions
Jacopini G., Mentrasti P. Theoretical Computer Science 66(3): 289-297, 1989. Type: Article
A partial function is invertible if and only if it is one-to-one. The authors provide a formalism for the invertible partial recursive functions of one argument. They show that this class of partial recursive functions is the cl...
|
Aug 1 1990 |
|
|
|
|
|
|
Recursively enumerable sets and degrees
Soare R., Springer-Verlag New York, Inc., New York, NY, 1987. Type: Book (9789780387152998)
This is a major and comprehensive treatise on classical recursion theory. It is a self-contained, highly readable, and excellently organized book whose coverage extends from the foundations of the theory of computable functions to the ...
|
Mar 1 1988 |
|
|
|
|
|
|
Concerning two-adjacent context-free languages
Dahlhaus E., Gaifman H. Theoretical Computer Science 41(2-3): 169-184, 1985. Type: Article
Let G be a context-free grammar. A derivation under G of &agr;n from &agr;o involves a sequence of stages &agr;...
|
Jun 1 1987 |
|
|
|
|
|
|
An intermediate machine technique for deciding equivalence between a DPDA and a linear DPDA
Itzhaik Y., Yehudai A. Information and Control 62(1): 26-35, 1984. Type: Article
This paper gives a rather simple algorithm for a very special case of the equivalence problem for deterministic context-free languages. The general equivalence problem for that class is still open. Given two Deterministic PushDown Auto...
|
Apr 1 1986 |
|
|
|
|
|
|
Linear indexed languages
Duske J., Parchmann R. Theoretical Computer Science 32(1-2): 47-60, 1984. Type: Article
Indexed grammars were introduced by Aho [1]. They generate a family of languages ℒ I lying properly between the context-free languages and the context-sensitive languages. Linear indexed ...
|
Nov 1 1985 |
|
|
|
|
|
| |
|
|
| |
|
|
