On the equivalence and containment problems for unambiguous regular expressions, grammars, and automata

Authors:
Richard E. Stearns;Harry B. Hunt
Affiliations:
-;-
Venue:
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Year:
1981

Citing 0
Cited 2

Minimal unambiguous εNFA

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Similarity in languages and programs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we use crossing number and wire area arguments to find lower bounds on the layout area and maximum edge length of a variety of computationally useful networks. In particular, we describe 1) an N-node planar graph which has layout area ...