Ingolfsdottir : A fully equational proof of Parikh's theorem, BRICS Report Series, 2001. ,
String-rewriting systems, Texts and Monographs in Computer Science, 1993. ,
Regular symbolic analysis of dynamic networks of pushdown systems, 16 th CONCUR, LNCS, vol.3653, pp.473-487, 2005. ,
Regular canonical systems, Archiv für Mathematische Logik und Grundlagenforschung, vol.6, pp.91-111, 1964. ,
Some properties of t-norms with threshold, pp.28-33, 2001. ,
Le : T-norms with threshold in fuzzy logic, pp.22-33, 2000. ,
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata, FSTTCS, LNCS 2914, pp.112-123, 2003. ,
DOI : 10.1007/978-3-540-24597-1_10
Regularity and Context-Freeness over Word Rewriting Systems, FOSSACS 2011, pp.214-228, 2011. ,
DOI : 10.1007/978-3-642-19805-2_15
URL : https://hal.archives-ouvertes.fr/hal-00867572
The theory of ground rewrite systems is decidable, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.242-248, 1990. ,
DOI : 10.1109/LICS.1990.113750
Rewrite Systems, Handbook of Theoretical Computer Science, pp.243-320, 1990. ,
DOI : 10.1016/B978-0-444-88074-1.50011-1
Decomposing terminating rewrite relations, 8 th WST, Computing Research Repository, pp.39-43, 2006. ,
On Fixed Point Equations over Commutative Semirings, th STACS, pp.296-307, 2007. ,
DOI : 10.1007/978-3-540-70918-3_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.3600
Match-Bounded String Rewriting Systems, Applicable Algebra in Engineering, Communication and Computing, vol.11, issue.3-4, pp.149-171, 2004. ,
DOI : 10.1007/s00200-004-0162-8
Bounded Algol-Like Languages, Transactions of the American Mathematical Society, vol.113, issue.2, pp.333-365, 1964. ,
DOI : 10.2307/1994067
Context-Limited Grammars, Journal of the ACM, vol.21, issue.3, pp.446-453, 1974. ,
DOI : 10.1145/321832.321842
Deleting string rewriting systems preserve regularity, Theoretical Computer Science, vol.327, issue.3, pp.301-317, 2004. ,
DOI : 10.1016/j.tcs.2004.04.009
Ullman : Introduction to automata theory, languages, and compilation, 1979. ,
Kozen : Parikh's theorem in commutative Kleene algebra [Im 88] N. Immerman, Nondeterministic space is closed under complementation, Logic in Computer Science (LICS'99, pp.394-401, 1988. ,
Dyck 1 -reductions of context-free languages, 6 th FCT, Kunc, A. Okhotin : Computing by commuting, Theoretical Computer Science 356, pp.218-227, 1987. ,
The theory of ends, pushdown automata, and second-order logic, Theoretical Computer Science, vol.37, pp.51-75, 1985. ,
DOI : 10.1016/0304-3975(85)90087-8
On context-free languages, J. Assoc. Comput. Mach, vol.13, issue.4, pp.570-581, 1966. ,