H-bounded and semi-discrete languages

DOI10.1016/S0019-9958(81)90253-9zbMath0507.68053MaRDI QIDQ4745283

Gabriel Thierrin, Michael Kunze, H. J. Shyr

Publication date: 1981

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

zbMATH Keywords

combinatorics of wordsprimitive wordssyntactic monoidshypercodes

Mathematics Subject Classification ID

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

Related Items (12)

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

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