Thue Specifications and Their Monadic Second-order Properties

Authors:
Teodor Knapik;Hugues Calbrix
Affiliations:
(Correspd.) IREMIA, Universit de la Reunion, BP 7151, 97715 Saint Denis Messageries Cedex 9, Reunion. e-mail: knapikuniv-reunion.fr;(Correspd.) College Jean Lecanuet, BP 1024, 76171 Rouen Cedex, France
Venue:
Fundamenta Informaticae
Year:
1999

Citing 19
Cited 0

Easy problems for tree-decomposable graphs

Journal of Algorithms
Finite automata

Handbook of theoretical computer science (vol. B)
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
Rewrite systems

Handbook of theoretical computer science (vol. B)
Algebraic specification

Handbook of theoretical computer science (vol. B)
String-rewriting systems

String-rewriting systems
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Monadic second-order definable graph transductions: a survey

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Branching-time temporal logic and tree automata

Information and Computation
Context-free languages and pushdown automata

Handbook of formal languages, vol. 1
Basics of term rewriting

Handbook of formal languages, vol. 3
On translations of temporal logic of actions into monadic second-order logic

Theoretical Computer Science
Automata for the Modal mu-Calculus and related Results

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
On Infinite Transition Graphs Having a Decidable Monadic Theory

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Property of Preserving Regularity for String-Rewriting Systems

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Formal Languages and Word-Rewriting

Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
The complexity of tree automata and logics of programs

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.