String and graph grammar characterizations of bounded regular languages

DOI10.1007/BF00991938MaRDI QIDQ4194489zbMATH OpenOpenAlexFDO

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

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

Describes a project that uses

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)