Sciweavers

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

21

DLT
2001

favoriteEmaildiscussreport

116views Theoretical Computer Science» more DLT 2001»

Context-Free Valence Grammars - Revisited

13 years 6 months ago

Context-Free Valence Grammars - Revisited

Download www.liacs.nl

Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization allows one to infer some of the properties of the family of valence languages, in particular the -free normal form proved by Fernau and Stiebe.

Hendrik Jan Hoogeboom

Real-time Traffic

Blind Kcounter Language | Context-free Language | Context-free Valence Languages | DLT 2001 | DLT 2007 |

claim paper

Related Content

» Estimating Compact Yet Rich Tree Insertion Grammars

» Learning ContextFree Grammars with a Simplicity Bias

» Analyzing Ambiguity of ContextFree Grammars

» Strongly Regular Grammars and Regular Approximation of ContextFree Languages

» Authorship Attribution Using Probabilistic ContextFree Grammars

» Learning deterministic context free grammars The Omphalos competition

» Linear ContextFree Rewriting Systems and Deterministic TreeWalking Transducers

» Incremental Parsing with Parallel Multiple ContextFree Grammars

» XML Validation for ContextFree Grammars

» Leveraging Lexical Semantics to Infer ContextFree Grammars

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	DLT
Authors	Hendrik Jan Hoogeboom

Comments (0)