Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation (Q5205044): Difference between revisions

Latest revision as of 09:05, 31 July 2024

scientific article; zbMATH DE number 7141925

Language	Label	Description	Also known as
English	Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation	scientific article; zbMATH DE number 7141925

Statements

instance of

scholarly article

0 references

title

Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation (English)

0 references

0 references

0 references

0 references

International Journal of Foundations of Computer Science

0 references

publication date

10 December 2019

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM

0 references

On the State Complexity of the Shuffle of Regular Languages

0 references

Quotient complexity of closed languages

0 references

State Complexity of Boundary of Prefix-Free Regular Languages

0 references

The Kuratowski Closure-Complement Problem

0 references

State complexity of basic operations on suffix-free regular languages

0 references

Q3655366

0 references

Q3862379

0 references

Cyclic Shift on Prefix-Free Languages

0 references

The Boundary of Prefix-Free Languages

0 references

Kuratowski algebras generated by factor-, subword-, and suffix-free languages

0 references

Kuratowski Algebras Generated by Prefix-Free Languages

0 references

Kleene Closure on Regular and Prefix-Free Languages

0 references

The State Complexity of Star-Complement-Star

0 references

Mathematical and engineering methods in computer science. 7th international doctoral workshop, MEMICS 2011, Lednice, Czech Republic, October 14--16, 2011. Revised selected papers

0 references

Kleene closure and state complexity

0 references

Star-Complement-Star on Prefix-Free Languages

0 references

Q3392273

0 references

Q4714446

0 references

full work available at URL

https://doi.org/10.1142/s0129054119400306

0 references

Identifiers

zbMATH Open document ID

1427.68146

0 references

DOI

10.1142/S0129054119400306

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5205044

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM
+Normal rank
@@ Property / cites work @@
+On the State Complexity of the Shuffle of Regular Languages
+Normal rank
@@ Property / cites work @@
+Quotient complexity of closed languages
@@ Property / cites work: Quotient complexity of closed languages / rank @@
+Normal rank
@@ Property / cites work @@
+State Complexity of Boundary of Prefix-Free Regular Languages
+Normal rank
@@ Property / cites work @@
+The Kuratowski Closure-Complement Problem
@@ Property / cites work: The Kuratowski Closure-Complement Problem / rank @@
+Normal rank
@@ Property / cites work @@
+State complexity of basic operations on suffix-free regular languages
+Normal rank
@@ Property / cites work @@
+Q3655366
@@ Property / cites work: Q3655366 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Cyclic Shift on Prefix-Free Languages
@@ Property / cites work: Cyclic Shift on Prefix-Free Languages / rank @@
+Normal rank
@@ Property / cites work @@
+The Boundary of Prefix-Free Languages
@@ Property / cites work: The Boundary of Prefix-Free Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Kuratowski algebras generated by factor-, subword-, and suffix-free languages
+Normal rank
@@ Property / cites work @@
+Kuratowski Algebras Generated by Prefix-Free Languages
+Normal rank
@@ Property / cites work @@
+Kleene Closure on Regular and Prefix-Free Languages
+Normal rank
@@ Property / cites work @@
+The State Complexity of Star-Complement-Star
@@ Property / cites work: The State Complexity of Star-Complement-Star / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical and engineering methods in computer science. 7th international doctoral workshop, MEMICS 2011, Lednice, Czech Republic, October 14--16, 2011. Revised selected papers
+Normal rank
@@ Property / cites work @@
+Kleene closure and state complexity
@@ Property / cites work: Kleene closure and state complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Star-Complement-Star on Prefix-Free Languages
@@ Property / cites work: Star-Complement-Star on Prefix-Free Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3392273
@@ Property / cites work: Q3392273 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0129054119400306
+Normal rank
@@ Property / OpenAlex ID @@
+W2973570009
@@ Property / OpenAlex ID: W2973570009 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127226764
@@ Property / Wikidata QID: Q127226764 / rank @@
+Normal rank