Complexity of automata evaluating formulas (Q1382592)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of automata evaluating formulas |
scientific article; zbMATH DE number 1134955
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of automata evaluating formulas |
scientific article; zbMATH DE number 1134955 |
Statements
Complexity of automata evaluating formulas (English)
0 references
29 March 1998
0 references
The paper deals with formulas in an operator form over a set consisting of all two-place operations and negation. The authors investigate the problem on minimal possible number of states for an automaton evaluating. Boolean expressions of a given length in various operator bases.
0 references
finite-state machines
0 references
logic algebra
0 references
0.8104565143585205
0 references
0.746408224105835
0 references
0.727057933807373
0 references