Efficient constructions of test sets for regular and context-free languages
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 249-258
- https://doi.org/10.1007/3-540-54345-7_68
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Parallel computations on strings and arraysPublished by Springer Nature ,1990
- On recent trends in formal language theoryLecture Notes in Computer Science, 1987
- A proof of Ehrenfeucht's ConjectureTheoretical Computer Science, 1985
- The Ehrenfeucht conjecture: a compactness claim for finitely generated free monoidsTheoretical Computer Science, 1984
- A note on finite-valued and finitely ambiguous transducersTheory of Computing Systems, 1983
- On binary equality sets and a solution to the test set conjecture in the binary caseJournal of Algebra, 1983
- Test sets for context free languages and algebraic systems of equations over a free monoidInformation and Control, 1982
- The decidability of equivalence for deterministic finite transducersJournal of Computer and System Sciences, 1979
- On the decidability of homomorphism equivalence for languagesJournal of Computer and System Sciences, 1978
- Rapid identification of repeated patterns in strings, trees and arraysPublished by Association for Computing Machinery (ACM) ,1972