Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata

DOI10.1007/978-3-662-53132-7_32zbMath1436.68189OpenAlexW2503835330MaRDI QIDQ2817405

Yuya Uezato, Yasuhiko Minamide

Publication date: 30 August 2016

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53132-7_32

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable

Cites Work

• Unnamed Item
• Unnamed Item
• Superdeterministic DPDAs: The method of accepting does affect decision problems
• The inclusion problem for simple languages
• Formal properties of XML grammars and languages
• An Intersection Type System for Deterministic Pushdown Automata
• Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
• Verified Decision Procedures on Context-Free Grammars
• The Inclusion Problem of Context-Free Languages: Some Tractable Cases
• Superdeterministic PDAs
• Generalizations of regular sets and their application to a study of context-free languages
• Types and higher-order recursion schemes for verification of higher-order programs
• Indexed Grammars—An Extension of Context-Free Grammars

This page was built for publication: Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata