Minimizing finite automata is computationally hard (Q703578): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(7 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.tcs.2004.03.070 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.070 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1964127120 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiple-entry finite automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of automaton identification from given data / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On measuring nondeterminism in regular languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4531373 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4045961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal NFA Problems are Hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Space-bounded reducibility among combinatorial problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New problems complete for nondeterministic log space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4503150 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Amounts of nondeterminism in finite automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On finite automata with limited nondeterminism / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4131648 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4714446 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2004.03.070 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:10, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimizing finite automata is computationally hard |
scientific article |
Statements
Minimizing finite automata is computationally hard (English)
0 references
11 January 2005
0 references
Finite automata
0 references
Limited nondeterminism
0 references
Minimization
0 references
NP-complete
0 references