Star-free sets of integers

DOI10.1016/0304-3975(86)90180-5zbMath0597.68060OpenAlexW1985283209MaRDI QIDQ1079381

Antonio Restivo, Aldo De Luca

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90180-5

zbMATH Keywords

star-free languagesRecognizable sets of nonnegative integers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Caractérisation results about $L$ codes ⋮ On number systems with finite degree of ambiguity

Cites Work

• Rational bijection of rational sets
• Semi-discrete context-free languages^†
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• On finite monoids having only trivial subgroups
• Bounded Regular Sets
• On the base-dependence of sets of numbers recognizable by finite automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Star-free sets of integers