Roots of Star Events
From MaRDI portal
Publication:5544298
DOI10.1145/321406.321409zbMath0162.02601OpenAlexW1978829149MaRDI QIDQ5544298
Publication date: 1967
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321406.321409
Related Items (23)
Factor theory and the unity of opposites ⋮ THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES ⋮ Algorithms for determining relative star height and star height ⋮ Components and acyclicity of graphs. An exercise in combining precision with concision ⋮ Expressive Capacity of Concatenation Freeness ⋮ Nondeterministic operational complexity in subregular languages ⋮ Inverse star, borders, and palstars ⋮ Nondeterministic state complexity of star-free languages ⋮ Unnamed Item ⋮ Algorithms for determining relative inclusion star height and inclusion star height ⋮ The inclusion problem for regular expressions ⋮ Determination of finite automata accepting subregular languages ⋮ Properties of code events and homomorphisms over regular events ⋮ Nondeterministic State Complexity of Star-Free Languages ⋮ Unnamed Item ⋮ General properties of star height of regular events ⋮ Star height of certain families of regular events ⋮ Free and almost-free subsemigroups of a free semigroup ⋮ A characterization of local regular languages ⋮ Mutually divisible semigroups ⋮ Closure properties of subregular languages under operations ⋮ Operations on subregular languages and nondeterministic state complexity ⋮ Concatenation-free languages
This page was built for publication: Roots of Star Events
