Ultimate-Definite and Symmetric-Definite Events and Automata
From MaRDI portal
Publication:5332221
DOI10.1145/321281.321292zbMath0127.01004OpenAlexW2018937876WikidataQ129991816 ScholiaQ129991816MaRDI QIDQ5332221
Publication date: 1965
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321281.321292
Related Items
Nondeterministic operational complexity in subregular languages ⋮ On the undecidability and descriptional complexity of synchronized regular expressions ⋮ Operational complexity in subregular classes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decision problems for convex languages ⋮ Determination of finite automata accepting subregular languages ⋮ Syntactic complexity of regular ideals ⋮ Unnamed Item ⋮ Some remarks on multiple-entry finite automata ⋮ Closure properties of subregular languages under operations