Decidability of equivalence for deterministic synchronized tree automata (Q671682): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
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/0304-3975(96)00073-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060424328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic two-tape automata / 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: Encompassment properties and automata with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pumping, cleaning and symbolic constraints solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down tree transducers with regular look-ahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down tree transducers with deterministic top-down look-ahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3485880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem of multitape finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of synchronization in parallel computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic versus nondeterministic space in terms of synchronized alternating machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronized finite automata and 2DFA reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings and grammars on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yield-languages recognized by alternating tree recognizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronized tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of structural equivalence of E0L grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Equivalence of Finite Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic top-down tree transducers with iterated look-ahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down tree transducers with two-way tree walking look-ahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:00, 27 May 2024

scientific article
Language Label Description Also known as
English
Decidability of equivalence for deterministic synchronized tree automata
scientific article

    Statements

    Decidability of equivalence for deterministic synchronized tree automata (English)
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    0 references