Very special languages and representations of recursively enumerable languages via computation histories
From MaRDI portal
Publication:3907111
DOI10.1016/S0019-9958(80)90537-9zbMath0457.68086MaRDI QIDQ3907111
Publication date: 1980
Published in: Information and Control (Search for Journal in Brave)
Related Items
On Boolean closed full trios and rational Kripke frames ⋮ Shuffled languages -- representation and recognition ⋮ On the expressive power of the shuffle operator matched with intersection by regular sets ⋮ Extending regular expressions with iterated shuffle
