Pages that link to "Item:Q1235014"

The following pages link to The inclusion problem for simple languages (Q1235014):

Displaying 30 items.

• Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
• Decision problems for pushdown threads (Q884992) (← links)
• New techniques for proving the decidability of equivalence problem (Q913523) (← links)
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
• Constructing a realtime deterministic pushdown automaton from a grammar (Q1051440) (← links)
• Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
• A representation of trees by languages. II (Q1137390) (← links)
• DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
• A representation of trees by languages. I (Q1246271) (← links)
• Two decidability results for deterministic pushdown automata (Q1254241) (← links)
• On equivalence of grammars through transformation trees (Q1259173) (← links)
• Monadic recursion schemes: The effect of constants (Q1259576) (← links)
• The inclusion problem for some subclasses of context-free languages (Q1978515) (← links)
• Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
• Nested session types (Q2233456) (← links)
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
• Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
• Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata (Q2817405) (← links)
• A NOTE ON LIMITED PUSHDOWN ALPHABETS IN STATELESS DETERMINISTIC PUSHDOWN AUTOMATA (Q2856007) (← links)
• String Analysis as an Abstract Interpretation (Q3075489) (← links)
• Infinite trees in normal form and recursive equations having a unique solution (Q3851585) (← links)
• (Q3922198) (← links)
• (Q3956423) (← links)
• On deciding some equivalences for concurrent processes (Q4362275) (← links)
• (Q4989409) (← links)
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
• (Q5089200) (← links)
• From Security Protocols to Pushdown Automata (Q5277904) (← links)
• State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
• Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)