Automaticity III: polynomial automaticity and context-free languages

Authors:
Ian Glaister;Jeffrey Shallit
Affiliations:
-;-
Venue:
Computational Complexity
Year:
1998

Citing 0
Cited 1

3-Party message complexity is better than 2-party ones for proving lower bounds on the size of minimal nondeterministic finite automata

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures

Quantified Score

Hi-index	0.00

Visualization

Abstract