A characterization of Thompson digraphs.
From MaRDI portal
Publication:1421476
DOI10.1016/S0166-218X(03)00299-3zbMath1074.68031MaRDI QIDQ1421476
Dora Giammarresi, Djelloul Ziadi, Jean-Luc Ponty, Derick Wood
Publication date: 26 January 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00299-3
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
05C75: Structural characterization of families of graphs
05C20: Directed graphs (digraphs), tournaments
Related Items
Smaller representation of compiled regular expressions, Series parallel digraphs with loops, Obtaining shorter regular expressions from finite-state automata, How to settle the ReDoS problem: back to the classical automata theory, From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity
Uses Software
Cites Work