New techniques for proving the decidability of equivalence problem (Q913523): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Karel II Culik / rank
Normal rank
 
Property / author
 
Property / author: Karel II Culik / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ALGOL 60 / 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: Test sets for finite substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Ehrenfeucht's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / 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: Single-valued a-transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of equivalence for deterministic finite transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decidability results about regular and pushdown translations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of the equivalence problem for DOL-systems / 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: Q3711770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3782819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of finite valued transducers (on HDT0L languages) is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizable deterministic pushdown automata and the decidability of their equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loops in automata and HDTOL relations / 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: Test sets and checking words for homomorphism equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inclusion problem for simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence problems for deterministic context-free languages and monadic recursion schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multitape one-way nonwriting automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Recursively Unsolvable Problems in ALGOL-Like Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / 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: The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications / 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: Complete problems for deterministic polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3782812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3817618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3736916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inclusion problem for some classes of deterministic multitape automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the translation of languages from left to right / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3239817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for real-time DPDAs / 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: The Ehrenfeucht conjecture: An algebra-framework for its proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness properties of matrix representations / 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: 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: Q4727438 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:46, 20 June 2024

scientific article
Language Label Description Also known as
English
New techniques for proving the decidability of equivalence problem
scientific article

    Statements

    New techniques for proving the decidability of equivalence problem (English)
    0 references
    1990
    0 references
    See the review in Zbl 0662.68079.
    0 references
    0 references
    0 references
    0 references
    0 references
    test sets
    0 references
    DPDA
    0 references
    decidability
    0 references
    equivalence
    0 references
    Ehrenfeucht conjecture
    0 references
    pushdown automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references