Talk:Aperiodic finite state automaton

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

This page is really confusing.169.232.92.106 (talk) 11:50, 27 January 2010 (UTC)[reply]

Could someone add an example language/grammar? --95.36.55.89 (talk) 06:52, 26 May 2010 (UTC)[reply]

Merger proposal[edit]

I propose to merge the page Star-free language as a section of this one.

Rationale: star-free languages and aperiodic DFAs as acceptors are two sides of the same coin and it makes more sense to me to discuss them together; but the scope of "Aperiodic finite state automaton" might be a bit larger (one could also discuss e.g. sequential transducers).— Preceding unsigned comment added by Nguyentito (talkcontribs) 12:41, 26 November 2019 (UTC)

Oppose; topics seem sufficiently independently notable to warrant separate coverage. Klbrain (talk) 20:37, 12 September 2020 (UTC)[reply]