Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q223814
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Juhani Karhumäki / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test sets for context free languages and algebraic systems of equations over a free monoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of equations over a free monoid and Ehrenfeucht's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability of homomorphism equivalence for languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superdeterministic DPDAs: The method of accepting does affect decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Strict Deterministic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equivalence of grammars through transformation trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability of equivalence for deterministic pushdown transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two decidability results for deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct algorithm for checking equivalence of LL(k) grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of equivalence for deterministic stateless pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for real-time strict deterministic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on the equivalence problem for deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic one-counter automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the KH algorithm fors-grammars / rank
 
Normal rank

Latest revision as of 19:41, 17 June 2024

scientific article
Language Label Description Also known as
English
Synchronizable deterministic pushdown automata and the decidability of their equivalence
scientific article

    Statements

    Synchronizable deterministic pushdown automata and the decidability of their equivalence (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    The authors introduce the concept of synchronized pushdown automaton and prove that the equivalence problem for these machines is decidable.
    0 references
    0 references
    0 references
    decidability of equivalence
    0 references
    synchronized pushdown automaton
    0 references
    equivalence problem
    0 references
    0 references
    0 references
    0 references