Sciweavers

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

10

BIRTHDAY
2004
Springer

favoriteEmaildiscussreport

65views Applied Computing» more BIRTHDAY 2004»

A Proof of Regularity for Finite Splicing

13 years 10 months ago

A Proof of Regularity for Finite Splicing

Download profs.sci.univr.it

We present a new proof that languages generated by (non extended) H systems with ﬁnite sets of axioms and rules are regular.

Vincenzo Manca

Real-time Traffic

Applied Computing | BIRTHDAY 2004 | ﬁnite Sets |

claim paper

Related Content

» On the regularity of circular splicing languages a survey and new developments

» An Algorithm for Transformation of Finite Automata to Regular Expressions

» A proof Procedure for Testing Membership in Regular Expressions

» Shorter Regular Expressions from FiniteState Automata

» Timed regular expressions

» Describing Syntax with StarFree Regular Expressions

» Lambek Calculus Proofs and Tree Automata

» XPath Typing Using a Modal Logic with Converse for Finite Trees

» Confluence of Pure Differential Nets with Promotion

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	BIRTHDAY
Authors	Vincenzo Manca

Comments (0)