Representation theorems on regular languages
From MaRDI portal
Publication:1052828
DOI10.1016/0022-0000(83)90031-4zbMath0516.68063MaRDI QIDQ1052828
Publication date: 1983
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(83)90031-4
68Q45: Formal languages and automata
Related Items
DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA, Distance desert automata and the star height problem, Polynomial operations and hierarchies of concatenation, Algorithms for determining relative inclusion star height and inclusion star height, Some results on the generalized star-height problem, New upper bounds to the limitedness of distance automata, On axioms for commutative regular equations without addition., The limitedness problem on distance automata: Hashiguchi's method revisited, On the power of circular splicing, Distance automata having large finite distance or finite ambiguity