Polynomial size test sets for commutative languages (Q4361579): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W48822877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test sets for homomorphism equivalence on context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test sets for context free languages and algebraic systems of equations over a free monoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Ehrenfeucht's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking sets, test sets, rich languages and commutatively closed languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial size test sets for context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient constructions of test sets for regular and context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank

Latest revision as of 19:40, 27 May 2024

scientific article; zbMATH DE number 1080092
Language Label Description Also known as
English
Polynomial size test sets for commutative languages
scientific article; zbMATH DE number 1080092

    Statements

    Identifiers