Tree automata with equality constraints modulo equational theories (Q2426520): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: Mobile values, new names, and secure communication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Basic paramodulation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equality and disequality constraints on direct subterms in tree automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pumping, cleaning and symbolic constraints solving / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata for reduction properties solving / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4385532 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2723425 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deciding \(\mathcal H_1\) by resolution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3838762 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tree automata with equality constraints modulo equational theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: STACS 2004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2848034 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4411948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2751359 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4808742 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Haskell overloading is DEXPTIME-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4808741 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: CONCUR 2005 – Concurrency Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4447233 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21:59, 27 June 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