The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: More concise representation of regular languages by automata and regular expressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4506483 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The state complexities of some basic operations on regular languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity measures for regular expressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Language operations with regular expressions of polynomial size / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Boolean closure of linear context-free languages / rank | |||
Normal rank | |||
Revision as of 12:51, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The size-cost of Boolean operations on constant height deterministic pushdown automata |
scientific article |
Statements
The size-cost of Boolean operations on constant height deterministic pushdown automata (English)
0 references
13 August 2012
0 references
finite state automata
0 references
regular languages
0 references
pushdown automata
0 references
