Thompson digraphs: A characterization

DOI10.1007/3-540-45526-4_9MaRDI QIDQ4474153zbMATH OpenFDO

Authors Jean-Luc Ponty, Dora Giammarresi, D. Wood

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2214/22140091.htm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Formal languages and automata (68Q45)

Recommendations

• A characterization of Thompson digraphs.
• Thompson languages
• An optimal construction of finite automata from regular expressions
• From regular expressions to deterministic automata
• From regular expressions to DFA's using compressed NFA's

Cited in

(2)

• A characterization of Thompson digraphs.
• Acyclic networks maximizing the printing complexity

This page was built for publication: Thompson digraphs: A characterization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474153)