REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE (Q3503088): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198075 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial algorithm for deciding bisimilarity of normed context-free processes / rank | |||
Normal rank | |||
Latest revision as of 09:25, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE |
scientific article |
Statements
REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE (English)
0 references
20 May 2008
0 references
concatenation state machines
0 references
stateless push-down automata
0 references
