Path: csiph.com!xmission!news.snarked.org!border2.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end
From: Andy <borucki.andrzej@gmail.com>
Newsgroups: comp.compilers
Subject: How make multifinished DFA for merged regexps?
Date: Thu, 19 Dec 2019 18:19:55 -0800 (PST)
Organization: Compilers Central
Lines: 13
Sender: news@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <19-12-005@comp.compilers>
Mime-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="9106"; mail-complaints-to="abuse@iecc.com"
Keywords: lex, question, DFA
Posted-Date: 19 Dec 2019 23:01:21 EST
X-submission-address: compilers@iecc.com
X-moderator-address: compilers-request@iecc.com
X-FAQ-and-archives: http://compilers.iecc.com
Xref: csiph.com comp.compilers:2386

I can create DFA direct from regexp.
But for language lexer I must have DFA for couple regexp.
One solution is crating DFA with multi finished states.
For example
r0 = ab
r1 = ac

  | 0 | 1
a | 1 |
b |   | 2(F)
c |   | 3(F)

How to check if r0 and r1 are disjoint?