Tree automata with equality constraints modulo equational theories (Q2426520): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jlap.2007.10.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967865708 / rank | |||
Normal rank | |||
Revision as of 02:32, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tree automata with equality constraints modulo equational theories |
scientific article |
Statements
Tree automata with equality constraints modulo equational theories (English)
0 references
22 April 2008
0 references
first-order theorem proving
0 references
tree automata
0 references
basic paramodulation
0 references
splitting
0 references
verification of infinite state systems
0 references
