\(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): journals/tcs/Senizergues01, #quickstatements; #temporary_batch_1732528864361
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for process generating context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / 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: Q4846257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5720480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A representation of trees by languages. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A representation of trees by languages. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic approach to the Korenjak-Hopcroft algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs, II: Infinite graphs of bounded width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. IV: Definability properties of equational graphs / 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: The IO- and OI-hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown machines for the macro tree transducer / 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: A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors / rank
 
Normal rank
Property / cites work
 
Property / cites work: DPDA's in 'Atomic normal form' and applications to equivalence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>n</i>-Rational Algebras I. Basic Properties and Free Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Families of Languages Related to ALGOL / 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: Q4198075 / 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: A polynomial algorithm for deciding bisimilarity of normed context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5517672 / 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: Bisimulation equivalence is decidable for one-counter processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular expressions and the equivalence of programs / 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: On formalised computer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for real-time strict deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the equivalence problem for deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences on program schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for LL- and LR-regular grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4116078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deciding the confluence of a finite string-rewriting system on a given congruence class / 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 equivalence problem for real-time strict deterministic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for real-time deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program equivalence and context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ianov's Program Schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On context-free languages and push-down automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decision problems about controlled rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic pushdown automata is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm testing partial confluence of basic semi-Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for normed pushdown processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict / 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: Iterated linear control and iterated one-turn pushdowns / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56386810 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/Senizergues01 / rank
 
Normal rank

Latest revision as of 11:02, 25 November 2024

scientific article
Language Label Description Also known as
English
\(L(A)=L(B)\)? decidability results from complete formal systems
scientific article

    Statements

    \(L(A)=L(B)\)? decidability results from complete formal systems (English)
    0 references
    12 December 2000
    0 references
    deterministic pushdown automata
    0 references
    rational series
    0 references
    finite-dimensional vector spaces
    0 references
    matrix semi-groups
    0 references
    complete formal systems
    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

    Identifiers