Dirk Hauschildt, Matthias Jantzen  Home/Search
Context Related
| informatik.unihamburg.d...matrix.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unih...biblio_jantzen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper shows that the languages over a one-letter alphabet generated by a context-free matrix grammar are always regular. Moreover we give a decision procedure for the question of whether a context-free matrix language is finite. Hereby we strengthen a result of [Mk 92] and settle a number of open questions in [DP 89]. Both results are obtained by a reduction to Petri net problems. 1 Introduction Petri nets and vector addition systems are different representations of the same construct.... (Update)
Context of citations to this paper: More
...MAT . It is known that CF MAT MAT ac = RE, the inclusions being proper. All one letter languages in the family MAT are regular, see [17]. A matrix grammar G = N; T ; S; M;F ) is said to be in the binary normal form if N = N 1 [ N 2 [ fS; #g, with these three sets mutually...
...we shall prove that FML MAT , where MAT is the family of languages generated by context free matrix grammars with arbitrary rules. Because ae RE ( 6] [8]) we obtain FML ae RE. Consider a matching system fl = V; ae; T; f; g; A; B d ; B u ) Define j a 2 V g; L(A)...
Cited by: More
Computational and modelling power of P systems - Besozzi (2004) (Correct)
Grammars with Regulated Rewriting - Jurgen Dassow.. (Correct)
Trading Polarizations for Labels in P Systems with Active.. - ALHAZOV, PAN, PAUN (Correct)
Active bibliography (related documents):
0.5: Decidability Issues for Petri Nets - a survey - Esparza, Nielsen (1994) (Correct)
Similar documents based on text: More All
0.4: Word Problems for 2-Homogeneous Monoids and Symmetric Logspace - Lohrey (Correct)
0.1: Cancellation in Context-Free Languages: Enrichment By Reduction - Jantzen, Petersen (1996) (Correct)
0.1: Grammars with Generalized Contextfree Rules and Their Tree Automata - Volger (1999) (Correct)
Related documents from co-citation: More All
42: Regulated Rewriting in Formal Language Theory (context) - Dassow, Paun - 1989
16: Formal Languages (context) - Salomaa - 1973
15: Handbook of Formal Languages (context) - Rozenberg, Salomaa - 1997
BibTeX entry: (Update)
D. Hauschildt and M. Jantzen. Petri net algorithms in the theory of matrix grammars. Acta Informatica, 31:719--728, 1994. http://citeseer.ist.psu.edu/hauschildt94petri.html More
@article{ hauschildt94petri,
author = "Dirk Hauschildt and Matthias Jantzen",
title = "Petri Net Algorithms in the Theory of Matrix Grammars",
journal = "Acta Informatica",
volume = "31",
number = "8",
pages = "719-728",
year = "1994",
url = "citeseer.ist.psu.edu/hauschildt94petri.html" }
Citations (may not include all citations):2 Mayr: Projections of vector addition system reachability set.. (context) - Kleine-Buning, Lettmann - 1989
1 Warmuth: Scattered versus context-sensitive rewriting (context) - Gonczarowski - 1989
1 Paun: Regular rewriting in formal language theory (context) - Dassow - 1989
1 Harrison: One-way stack automata (context) - Ginsburg, Greibach - 1967
1 SIAM Journal of Computation (context) - Mayr, for et al. - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-hamburg.de/TGI/publikationen/biblio_jantzen.html): More
On Twist-Closed Trios - Jantzen (1997) (Correct)
Cancellation in Context-Free Languages: Enrichment By Reduction - Jantzen, Petersen (1996) (Correct)
On Twist-Closed Trios: A New Morphic Characterization of r.e. Sets - Jantzen (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC