Pages that link to "Item:Q1589483"

The following pages link to \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483):

Displaying 31 items.

• Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
• Quasi-rocking real-time pushdown automata (Q650904) (← links)
• On the computational complexity of bisimulation, redux (Q703845) (← links)
• Decision problems for pushdown threads (Q884992) (← links)
• \(L(A)=L(B)\)? A simplified decidability proof. (Q1603704) (← links)
• Word problems of groups: formal languages, characterizations and decidability (Q1623276) (← links)
• Some decision problems concerning semilinearity and commutation. (Q1872706) (← links)
• An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
• Some properties of iterated languages (Q2011823) (← links)
• Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
• Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
• Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358) (← links)
• Rational subsets of partially reversible monoids (Q2378535) (← links)
• A note on controllability of deterministic context-free~systems (Q2391510) (← links)
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
• Equivalence of deterministic pushdown automata revisited (Q2458041) (← links)
• A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
• Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
• Simplification Problems for Deterministic Pushdown Automata on Infinite Words (Q2800412) (← links)
• Set Automata (Q2814837) (← links)
• A NOTE ON LIMITED PUSHDOWN ALPHABETS IN STATELESS DETERMINISTIC PUSHDOWN AUTOMATA (Q2856007) (← links)
• Model-Checking Games for Typed λ-Calculi (Q2864164) (← links)
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
• Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
• On the Density of Context-Free and Counter Languages (Q4640039) (← links)
• THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE (Q4923292) (← links)
• Optimally Resilient Strategies in Pushdown Safety Games (Q5089248) (← links)
• Universality Problem for Unambiguous VASS (Q5089303) (← links)
• Queue Automata: Foundations and Developments (Q5112182) (← links)
• Self-Verifying Pushdown and Queue Automata (Q5164866) (← links)
• A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)