Open Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 56, 2022
|
|
|---|---|---|
| Article Number | 8 | |
| Number of page(s) | 31 | |
| DOI | https://doi.org/10.1051/ita/2022008 | |
| Published online | 14 October 2022 | |
- J. Berstel, Transductions and context-free languages, vol. 38 of Teubner Studienbücher : Informatik. Teubner (1979). [Google Scholar]
- D. Caucal, On the regular structure of prefix rewriting, Theor. Comput. Sci. 106 (1992) 61–86. [CrossRef] [Google Scholar]
- L. Chottin, Strict deterministic languages and controlled rewriting systems, in Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings, Lecture Notes in Computer Science, edited by H.A. Maurer. vol. 71, Springer (1979) 104–117. [CrossRef] [Google Scholar]
- L. Chottin, Langages Algébriques et Systèmes de Réécriture Rationels. ITA 16 (1982) 93–112. [Google Scholar]
- M. Clerbout and Y. Roos, Semi-commutations and algebraic languages, edited by C. Choffrut and T. Lengauer, STACS 90, vol. 415, Lecture Notes in Computer Science. Springer Berlin/Heidelberg (1990) 82–94. [CrossRef] [Google Scholar]
- A. Geser, Decidability of termination of grid string rewriting rules. SIAM J. Comput. 31 (2002) 1156–1168. [CrossRef] [MathSciNet] [Google Scholar]
- A. Geser, D. Hofbauer and J. Waldmann, Match-bounded string rewriting systems. Appl. Algebra Eng. Commun. Comput. 15 (2004) 149–171. [CrossRef] [Google Scholar]
- A. Geser, D. Hofbauer and J. Waldmann, Termination proofs for string rewriting systems via inverse match-bounds. J. Autom. Reason. 34 (2005) 365–385. [CrossRef] [Google Scholar]
- D. Hofbauer and J. Waldmann, Deleting string rewriting systems preserve regularity, Theor. Comput. Sci. 327 (2004) 301–317. [CrossRef] [Google Scholar]
- M. Latteux and Y. Roos, On one-rule grid semi-thue systems. Fundam. Inform. 116 (2012) 189–204. [CrossRef] [Google Scholar]
- M. Latteux and Y. Roos, On prefixal one-rule string rewrite systems. Theor. Comput. Sci. 795 (2019) 240–256. [CrossRef] [Google Scholar]
- P. Leupold, On regularity-preservation by string-rewriting systems, edited by C. Martĺn-Vide, F. Otto and H. Fernau, Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, Lecture Notes in Computer Science, vol. 5196, Springer (2008) 345–356. [Google Scholar]
- R.C. Lyndon and M.P. Schutzenberger, The equation aM =bNcP in a free group. Michigan Math. J. 9 (1962) 289–298. [CrossRef] [MathSciNet] [Google Scholar]
- R. McNaughton, Semi-Thue systems with an inhibitor. J. Autom. Reason. 26 (2001) 409–431. [CrossRef] [Google Scholar]
- M. Nivat, Transductions des langages de Chomsky. Ann. l'Inst. Fourier 18 (1968) 339–455. [CrossRef] [MathSciNet] [Google Scholar]
- J. Sakarovitch, Elements of Automata Theory, Cambridge University Press, New York, NY, USA (2009). [Google Scholar]
- G. Séenizergues, Some decision problems about controlled rewriting systems. Theor. Comput. Sci. 71 (1990) 281–346. [CrossRef] [Google Scholar]
- G. Sénizergues, Formal languages & word-rewriting, edited by H. Comon and J.-P. Jounnaud, Term Rewriting: French Spring School of Theoretical Computer Science Font Romeux, France, May 17-21, 1993 Advanced Course, Springer Berlin Heidelberg, Berlin, Heidelberg (1995) 75–94. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.