Linear size test sets for certain commutative languages
From MaRDI portal
Publication:3149085
DOI10.1051/ITA:2001105zbMATH Open1010.68103OpenAlexW2121340062MaRDI QIDQ3149085FDOQ3149085
Authors: Juha Kortelainen, Štěpán Holub
Publication date: 24 September 2002
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_5_453_0
Recommendations
- Polynomial size test sets for commutative languages
- Parikh test sets for commutative languages
- Polynomial size test sets for context-free languages
- Polynomial size test sets for context-free languages
- Linearizing term rewriting systems using test sets
- Efficient constructions of test sets for regular and context-free languages
- scientific article; zbMATH DE number 176145
- Piecewise testable languages via combinatorics on words
- On languages piecewise testable in the strict sense
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local and global cyclicity in free semigroups
- A proof of Ehrenfeucht's conjecture
- On binary equality sets and a solution to the test set conjecture in the binary case
- Checking sets, test sets, rich languages and commutatively closed languages
- On the size of independent systems of equations in semigroups
- On the system of word equations \(x_{0} u^{i}_{1} x_{1} u^{i}_{2} x_{2} u^{i}_{3} x_{3}=y_{0} v^{i}_{1} y_{1} v^{i}_{2} y_{2} v^{i}_{3} y_{3}\) \((i=0,1,2,\ldots)\) in a free monoid
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial size test sets for commutative languages
Cited In (6)
This page was built for publication: Linear size test sets for certain commutative languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3149085)