H-bounded and semi-discrete languages

DOI10.1016/S0019-9958(81)90253-9zbMATH Open0507.68053MaRDI QIDQ4745283FDOQ4745283

Authors: Michael Kunze, H. J. Shyr, Gabriel Thierrin 

Publication date: 1981

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

primitive wordscombinatorics of wordssyntactic monoidshypercodes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (11)

• F-Disjunctive languagest
• The single loop representations of regular languages
• Periodic and Sturmian languages
• On differentiation functions, structure functions, and related languages of context-free grammars
• A characterization of poly-slender context-free languages
• Quasi-completely right disjunctive languages
• Detecting palindromes, patterns and borders in regular languages
• One-dimensional pattern generation by cellular automata
• Semi-discrete context-free languages^†
• Finite Automata, Palindromes, Powers, and Patterns
• Disjunctive decomposition of languages

This page was built for publication: H-bounded and semi-discrete languages

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