论文信息 - Thue Specifications and Their Monadic Second-order Properties

Thue Specifications and Their Monadic Second-order Properties

This paper introduces oriented Thue specifications and their models which are simple directed edge-labeled graphs. The monadic second-order theory of these models is investigated and shown decidable for the class of suffix-bounded rational oriented Thue specifications. In addition, a characterization of prefix-closed context-free languages is given in terms of oriented Thue specifications.

Teodor Knapik | Hugues Calbrix

[1] Igor Walukiewicz,et al. Automata for the Modal mu-Calculus and related Results , 1995, MFCS.

[2] Teodor Knapik,et al. A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs , 1998, FSTTCS.

[3] David E. Muller,et al. The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..

[4] Didier Caucal,et al. On infinite transition graphs having a decidable monadic theory , 1996, Theor. Comput. Sci..

[5] Bruno Courcelle,et al. Monadic Second-Order Definable Graph Transductions: A Survey , 1994, Theor. Comput. Sci..

[6] Calvin C. Elgot,et al. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor , 1966, Journal of Symbolic Logic.

[7] Orna Grumberg,et al. Branching-Time Temporal Logic and Tree Automata , 1996, Inf. Comput..

[8] Friedrich Otto. On the Property of Preserving Regularity for String-Rewriting Systems , 1997, RTA.

[9] Friedrich Otto,et al. String-Rewriting Systems , 1993, Text and Monographs in Computer Science.

[10] Alexander Moshe Rabinovich. On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic , 1998, Theor. Comput. Sci..

[11] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[12] E. Allen Emerson,et al. The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.