Tree automata with equality constraints modulo equational theories (Q2426520): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jlap.2007.10.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JLAP.2007.10.006 / rank | |||
Normal rank | |||
Latest revision as of 12:45, 28 December 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
