The universe problem for unrestricted flow languages
From MaRDI portal
Publication:1165586
DOI10.1007/BF00263929zbMath0487.68065OpenAlexW2029208718MaRDI QIDQ1165586
Publication date: 1983
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00263929
Related Items
Literal shuffle ⋮ Regularity Conditions for Iterated Shuffle on Commutative Regular Languages ⋮ There is no complete axiom system for shuffle expressions ⋮ Shuffle and scattered deletion closure of languages ⋮ Characterization and complexity results on jumping finite automata
