Observations about bounded languages and developmental systems

DOI10.1007/BF01683276zbMATH Open0356.68092MaRDI QIDQ4128032FDOQ4128032

Authors: Meera Blattner, Armin B. Cremers 

Publication date: 1977

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Semigroups, Presburger formulas, and languages
• Bounded Algol-Like Languages
• Indexed Grammars—An Extension of Context-Free Grammars
• Title not available (Why is that?)
• One-way stack automata
• An infinite hierarchy of intersections of context-free languages
• Extension of tabled 0L-systems and languages
• Title not available (Why is that?)

Cited In (2)

• Algorithms for learning regular expressions from positive data
• Computational complexity of synchronization under sparse regular constraints

Uses Software

• ALGOL 60

This page was built for publication: Observations about bounded languages and developmental systems

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