\(L(A)=L(B)\)? decidability results from complete formal systems
type: Item
instance of: scholarly article
title: \(L(A)=L(B)\)? decidability results from complete formal systems
zbMATH Open document ID: 0957.68051
DOI: 10.1016/S0304-3975(00)00285-1
published in: Theoretical Computer Science
publication date: 2000-12-12T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1542288
zbMATH Keywords: deterministic pushdown automata
zbMATH Keywords: rational series
zbMATH Keywords: finite-dimensional vector spaces
zbMATH Keywords: matrix semi-groups
zbMATH Keywords: complete formal systems
author: Géraud Sénizergues
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
cites work: Q4385528
cites work: Decidability of bisimulation equivalence for process generating context-free languages
cites work: Graph expressions and graph rewritings
cites work: An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
cites work: Q4846257
cites work: Q3853135
cites work: Q5720480
cites work: Q5526125
cites work: Q5639639
cites work: A representation of trees by languages. I
cites work: A representation of trees by languages. II
cites work: An axiomatic approach to the Korenjak-Hopcroft algorithms
cites work: Fundamental properties of infinite trees
cites work: The monadic second-order logic of graphs, II: Infinite graphs of bounded width
cites work: Q4385531
cites work: The monadic second-order logic of graphs. IV: Definability properties of equational graphs
cites work: Synchronizable deterministic pushdown automata and the decidability of their equivalence
cites work: The IO- and OI-hierarchies
cites work: Pushdown machines for the macro tree transducer
cites work: Equivalence problems for deterministic context-free languages and monadic recursion schemes
cites work: A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors
cites work: DPDA's in 'Atomic normal form' and applications to equivalence problems
cites work: n-Rational Algebras I. Basic Properties and Free Algebras
cites work: Q4146243
cites work: Deterministic context free languages
cites work: Two Families of Languages Related to ALGOL
cites work: The equivalence problem of multitape finite automata
cites work: Q4198075
cites work: On equivalence of grammars through transformation trees
cites work: A polynomial algorithm for deciding bisimilarity of normed context-free processes
cites work: Q5517672
cites work: On the decidability of equivalence for deterministic pushdown transducers
cites work: Bisimulation equivalence is decidable for one-counter processes
cites work: Regular expressions and the equivalence of programs
cites work: On the translation of languages from left to right
cites work: On formalised computer programs
cites work: Q4134981
cites work: The equivalence problem for real-time strict deterministic pushdown automata
cites work: Decidability of the equivalence problem for deterministic pushdown automata
cites work: Equivalences on program schemes
cites work: The equivalence problem for LL- and LR-regular grammars
cites work: Q4116078
cites work: On deciding the confluence of a finite string-rewriting system on a given congruence class
cites work: The equivalence problem for real-time DPDAs
cites work: The equivalence problem for real-time strict deterministic languages
cites work: Q5573961
cites work: Q3947147
cites work: The equivalence problem for real-time deterministic pushdown automata
cites work: Program equivalence and context-free grammars
cites work: Properties of deterministic top-down grammars
cites work: On Ianov's Program Schemata
cites work: On context-free languages and push-down automata
cites work: Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
cites work: Some decision problems about controlled rewriting systems
cites work: The equivalence problem for deterministic pushdown automata is decidable
cites work: A polynomial algorithm testing partial confluence of basic semi-Thue systems
cites work: Decidability of bisimulation equivalence for normed pushdown processes
cites work: A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict
cites work: The equivalence problem for deterministic finite-turn pushdown automata
cites work: Deterministic one-counter automata
cites work: Iterated linear control and iterated one-turn pushdowns
Wikidata QID: Q56386810

\(L(A)=L(B)\)? decidability results from complete formal systems (DBLP publication ID)
DBLP publication ID: journals/tcs/Senizergues01