Part of the Lecture Notes in Computer Science book series (LNCS, volume 2136)
Rational Graphs Trace Context-Sensitive Languages
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.
KeywordsTuring Machine Regular Language Transition Graph Rational Graph Complete Binary Tree
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Autebert, J.-M. and Boasson, L.Transductions rationelles. Masson, 1988.Google Scholar
- 2.Berstel, J.Transductions and contextfree languages. Teubner, 1979.Google Scholar
- 3.Moller, F. Burkart, O., Caucal, D. and Steffen B.Handbook of Process Algebra, chapter Verification on infinite structures, pages 545–623. Elsevier, 2001.Google Scholar
- 4.Caucal, D. On transition graphs having a decidable monadic theory. In Icalp 96, volume 1099 of LNCS, pages 194–205, 1996.Google Scholar
- 5.Courcelle, B.Handbook of Theoretical Computer Science, chapter Graph rewriting: an algebraic and logic approach. Elsevier, 1990.Google Scholar
- 7.Knapik, T. and Payet, E. Synchronization product of linear bounded machines. In FCT, volume 1684 of LNCS, pages 362–373, 1999.Google Scholar
- 8.Mateescu, A., Salomaa, A.Handbook of Formal Languages, volume 1, chapter Aspects of classical language theory, pages 175–252. Springer-Verlag, 1997.Google Scholar
- 9.Morvan, C. On rational graphs. In Fossacs 00, volume 1784 of LNCS, pages 252–266, 2000.Google Scholar
© Springer-Verlag Berlin Heidelberg 2001