String and graph grammar characterizations of bounded regular languages

DOI10.1007/BF00991938zbMATH Open0407.68084OpenAlexW2010648600MaRDI QIDQ4194489FDOQ4194489

Authors: Kenneth B. Salomon 

Publication date: 1978

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00991938

zbMATH Keywords

Recognition By AutomataGraph GrammarsBounded Regular LanguagesSecond-Order Contextfree Graph GrammarSequential Right-Linear String GrammarState Graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Bounded Algol-Like Languages
• Optimization of LR(k) parsers
• Title not available (Why is that?)
• Bounded Regular Sets
• Linear and Context-Free Graph Grammars
• Pair grammars, graph languages and string-to-graph translations
• Substitution and bounded languages
• First Order Graph Grammars
• Separable graphs, planar graphs and web grammars
• Web grammars and several graphs
• The decidability of a mapping problem for generalized sequential machines with final states

Uses Software

• ALGOL 60

This page was built for publication: String and graph grammar characterizations of bounded regular languages

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