A characterization of semilinear sets

DOI10.1016/S0022-0000(70)80015-0zbMath0231.68025MaRDI QIDQ2550630

L. Y. Liu, P. Weiner

Publication date: 1970

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Unnamed Item ⋮ Cônes rationnels commutatifs ⋮ Simple counter machines and number-theoretic problems ⋮ On bounded languages and reversal-bounded automata ⋮ The complexity of the equivalence problem for two characterizations of Presburger sets ⋮ Intersections de langages algébriques bornes ⋮ Some classes of languages in \(NC^ 1\) ⋮ A characterization of semilinear sets ⋮ Language recognition by two-way deterministic pushdown automata ⋮ Theory of formal grammars

Uses Software

• ALGOL 60

Cites Work

• Semigroups, Presburger formulas, and languages
• A characterization of semilinear sets
• Ambiguity in context free languages
• Bounded Algol-Like Languages
• On Context-Free Languages
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of semilinear sets