Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2735959
Jump to:navigation, search

zbMath0983.68111MaRDI QIDQ2735959

Wang, Ming-wei

Publication date: 4 September 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Formal languages and automata (68Q45)


Related Items (11)

Prefix-suffix square reduction ⋮ Tandem Duplications, Segmental Duplications and Deletions, and Their Applications ⋮ Languages generated by iterated idempotency ⋮ Uniformly bounded duplication codes ⋮ Prefix-suffix duplication ⋮ Uniformly bounded duplication languages ⋮ Operations and language generating devices suggested by the genome evolution ⋮ On the Prefix–Suffix Duplication Reduction ⋮ On Compensation Loops in Genomic Duplications ⋮ Watson–Crick Jumping Finite Automata ⋮ Computing the Tandem Duplication Distance is NP-Hard




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2735959&oldid=15599951"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki