Labelled stratified graphs can generate formal languages

MaRDI QIDQ2804682zbMATH OpenFDO

Authors Tudor (Preda) Irina-Valentina

Publication date 4 May 2016

zbMATH Keywords

interpretationregular languagecontext-free languagelabelled graphlabelled stratified graphPeano algebrarecursive transition network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Formal languages and automata (68Q45)

Recommendations

• Generating natural language by labelled stratified graphs
• Formal languages generation in systems of knowledge representation based on stratified graphs
• Properties of stratified languages
• Languages which can be represented by completely labelled graphs
• Characteristics of graph languages generated by edge replacement

Cited in

(4)

• Generating natural language by labelled stratified graphs
• Splitting the structured paths in stratified graphs. Application in natural language generation.
• Properties of stratified languages
• Formal languages generation in systems of knowledge representation based on stratified graphs

This page was built for publication: Labelled stratified graphs can generate formal languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804682)