Ultimate-Definite and Symmetric-Definite Events and Automata
From MaRDI portal
Publication:5332221
DOI10.1145/321281.321292zbMath0127.01004MaRDI 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
Unnamed Item, Unnamed Item, Unnamed Item, Decision problems for convex languages, Syntactic complexity of regular ideals, Some remarks on multiple-entry finite automata, Determination of finite automata accepting subregular languages