It is proved that every bounded context-free language L is commutatively equivalent to a regular language L', that is, there exists a bijection from L onto L' preserving the Parikh vectors of words.
The commutative equivalence of bounded context-free and regular languages / D'Alessandro, Flavio; Intrigila, B.. - STAMPA. - (2011). (Intervento presentato al convegno International Conference on words and formal languages, Words 2011 tenutosi a Prague; Czech Republic).
The commutative equivalence of bounded context-free and regular languages
D'ALESSANDRO, Flavio;
2011
Abstract
It is proved that every bounded context-free language L is commutatively equivalent to a regular language L', that is, there exists a bijection from L onto L' preserving the Parikh vectors of words.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
