Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

FOSSACS
2011
Springer

favoriteEmaildiscussreport

198views Software Engineering» more FOSSACS 2011»

Regularity and Context-Freeness over Word Rewriting Systems

13 years 2 months ago

Regularity and Context-Freeness over Word Rewriting Systems

Download www-igm.univ-mlv.fr

We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivation relation of a system R ∪ D, where R is a strict sub-system of R and D is the Dyck rewriting system. From this decomposition, we deduce that the system R (resp. R−1 ) preserves regular (resp. context-free) languages whenever R ∪ D does. From this we can deduce regularity and context-freeness preservation properties for a generalization of tagged biﬁx systems.

Didier Caucal, Dinh Trong Hieu

Real-time Traffic

FOSSACS 2011 | Free Languages | Rewriting System | Software Engineering | System R |

claim paper

Related Content

» Query containment and rewriting using views for regular path queries under constraints

» Infinite Families of Finite String Rewriting Systems and Their Confluence

» Reachability in Unions of Commutative Rewriting Systems Is Decidable

» Regular rewriting of active XML and unambiguity

» Rewriting Regular XPath Queries on XML Views

» PDL over Accelerated Labeled Transition Systems

» On Tree Automata that Certify Termination of LeftLinear Term Rewriting Systems

» Reachability Problems on Regular Ground Tree Rewriting Graphs

» An Optimization Technique for Answering Regular Path Queries

Post Info
More Details (n/a)

Added	28 Aug 2011
Updated	28 Aug 2011
Type	Journal
Year	2011
Where	FOSSACS
Authors	Didier Caucal, Dinh Trong Hieu

Comments (0)