Minimal cover-automata for finite languages (Q5958721): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59595166 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3692867 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3976039 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4036562 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A class of measures on formal languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automaticity. I: Properties of a measure of descriptional complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5588675 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The state complexities of some basic operations on regular languages / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(00)00292-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2037872771 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:53, 30 July 2024
scientific article; zbMATH DE number 1715766
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimal cover-automata for finite languages |
scientific article; zbMATH DE number 1715766 |
Statements
Minimal cover-automata for finite languages (English)
0 references
3 March 2002
0 references
finite languages
0 references
deterministic finite automata
0 references
cover language
0 references
deterministic cover automata
0 references