Search the dblp DataBase
Uwe Mönnich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Uwe Mönnich
Adjunction As Substitution: An Algebraic Formulation of Regular Context-Free and Tree Adjoining Languages [Citation Graph (0, 0)][DBLP]
CoRR, 1997, v:0, n:, pp:- [Journal] - Uwe Mönnich
On Cloning Context-Freeness [Citation Graph (0, 0)][DBLP]
CoRR, 1997, v:0, n:, pp:- [Journal] - Frank Morawietz, Uwe Mönnich
A Model-Theoretic Description of Tree Adjoining Grammars. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2001, v:53, n:, pp:- [Journal] - Hans-Peter Kolb, Uwe Mönnich, Frank Morawietz
Descriptions of Cross-Serial Dependencies. [Citation Graph (0, 0)][DBLP]
Grammars, 2000, v:3, n:2/3, pp:189-216 [Journal] - Stephan Kepser, Uwe Mönnich
Closure properties of linear context-free tree languages with an application to optimality theory. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:354, n:1, pp:82-97 [Journal] - Hans-Peter Kolb, Jens Michaelis, Uwe Mönnich, Frank Morawietz
An operational and denotational approach to non-context-freeness. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:293, n:2, pp:261-289 [Journal] - Anton Nijholt, Giuseppe Scollo, Uwe Mönnich
Editorial. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:354, n:1, pp:1-3 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002