2006/68/1-2 (13) — DOI: 10.5486/PMD.2006.3303 — pp. 183-197
Full Text Abstract

Union-free regular languages and 1-cycle-free-path-automata

Authors: Benedek Nagy

Keywords: union-free languages, regular expressions, regular languages, finite automaton, directed graphs

Mathematics Subject Classification: 68Q45