Polynomial size test sets for commutative languages
From MaRDI portal
Recommendations
- Polynomial size test sets for context-free languages
- Polynomial size test sets for context-free languages
- Linear size test sets for certain commutative languages
- Parikh test sets for commutative languages
- scientific article; zbMATH DE number 1072537
- Test complexity of generic polynomials
- Piecewise testable languages via combinatorics on words
- The Boolean algebra of piecewise testable languages
- Syntactical and automatic properties of sets of polynomials over finite fields
- Developments in Language Theory
Cites work
- A proof of Ehrenfeucht's conjecture
- Checking sets, test sets, rich languages and commutatively closed languages
- Efficient constructions of test sets for regular and context-free languages
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- On the system of word equations \(x^ i_ 1 x^ i_ 2\dots x^ i_ m=y^ i_ 1 y^ i_ 2\dots y^ i_ n\) \((i=1,2,\dots)\) in a free monoid
- Polynomial size test sets for context-free languages
- Test sets for context free languages and algebraic systems of equations over a free monoid
- Test sets for homomorphism equivalence on context free languages
Cited in
(3)
This page was built for publication: Polynomial size test sets for commutative languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4361579)
