The inclusion problem for simple languages
From MaRDI portal
Publication:1235014
Cites work
- Decidable and Undecidable Questions About Automata
- Decidable Properties of Monadic Functional Schemas
- scientific article; zbMATH DE number 3490487 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
- Properties of deterministic top-down grammars
- Real-Time Strict Deterministic Languages
- The equivalence problem for deterministic two-tape automata
- The theory of languages
Cited in
(34)- Constructing a realtime deterministic pushdown automaton from a grammar
- Superdeterministic DPDAs: The method of accepting does affect decision problems
- A representation of trees by languages. II
- DPDA's in 'Atomic normal form' and applications to equivalence problems
- A representation of trees by languages. I
- Two decidability results for deterministic pushdown automata
- On equivalence of grammars through transformation trees
- Monadic recursion schemes: The effect of constants
- The inclusion problem for some subclasses of context-free languages
- Complexity of universality and related problems for partially ordered NFAs
- Nested session types
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
- Bisimulation equivalence and regularity for real-time one-counter automata
- Monoid-based approach to the inclusion problem on superdeterministic pushdown automata
- A note on limited pushdown alphabets in stateless deterministic pushdown automata
- String analysis as an abstract interpretation
- Infinite trees in normal form and recursive equations having a unique solution
- scientific article; zbMATH DE number 3735179 (Why is no real title available?)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- scientific article; zbMATH DE number 3776892 (Why is no real title available?)
- On deciding some equivalences for concurrent processes
- Partially ordered automata and piecewise testability
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- Synchronizing deterministic push-down automata can be really hard
- From security protocols to pushdown automata
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
- The different shades of infinite session types
- Synchronizing deterministic push-down automata can be really hard
- Decidability results in automata and process theory
- Subtyping context-free session types
- Subtyping context-free session types
- Decision problems for pushdown threads
- New techniques for proving the decidability of equivalence problem
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
This page was built for publication: The inclusion problem for simple languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1235014)
