Three New Algorithms for Regular Language Enumeration (Q5323062): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_19 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1504040240 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient enumeration of words in regular languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finite Automata, Palindromes, Powers, and Patterns / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5639639 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4231580 / rank | |||
Normal rank | |||
Latest revision as of 20:22, 1 July 2024
scientific article; zbMATH DE number 5585619
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three New Algorithms for Regular Language Enumeration |
scientific article; zbMATH DE number 5585619 |
Statements
Three New Algorithms for Regular Language Enumeration (English)
0 references
23 July 2009
0 references
