Test sets for large families of languages

Authors:
Wojciech Plandowski
Affiliations:
Institute of Informatics, University of Warsaw, Warszawa, Poland
Venue:
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Year:
2003

Citing 12
Cited 1

A proof of Ehrenfeucht's conjecture

Theoretical Computer Science
Efficient constructions of test sets for regular and context-free languages

Theoretical Computer Science
Polynomial size test sets for context-free languages

Journal of Computer and System Sciences
On the size of independent systems of equations in semigroups

MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Combinatorics of words

Handbook of formal languages, vol. 1
On the system of word equations x0ui1x1ui 2x2&ldots;uimxm =y0vi1y1vi 2y2&ldots;vinyn i=0,1,2,&ldots; in a free monoid

Journal of Automata, Languages and Combinatorics
On the system of word equations xouiix1ui 2x2ui3x3=y 0vi1y1vi 2 y2vi3y3 i=0,1,2,&ldots; in a free monoid

Theoretical Computer Science
Local and global cyclicity in free semigroups

Theoretical Computer Science
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Compactness of Systems of Equations on Completely Regular Semigroups

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
The Equivalence of DGSM Replications on Q-Rational Languages is Decidable

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Testing Equivalence of Morphisms on Context-Free Languages

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms

Explicit test sets for iterated morphisms in free monoids and metabelian groups

Theoretical Computer Science - Insightful theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the lower and upper bounds for sizes of test sets for the families of all languages, of commutative languages, of regular languages and of context-free languages.