Generalizations of regular sets and their application to a study of context-free languages

DOI10.1016/S0019-9958(75)90058-3zbMATH Open0291.68031MaRDI QIDQ4042672FDOQ4042672

Authors: Masako Takahashi 

Publication date: 1975

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (13)

• Automata on finite trees
• Title not available (Why is that?)
• Variants of top-down tree transducers with look-ahead
• Query automata over finite trees
• Attribute grammars for unranked trees as a query language for structured documents
• Conjunctive query containment over trees using schema information
• The equivalence and inclusion problems for NTS languages
• Monoid-based approach to the inclusion problem on superdeterministic pushdown automata
• Generalized parenthesis languages and minimization of their parenthesis parts
• THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES
• Nest sets and relativized closure properties
• Weighted monadic Datalog
• Remarques sur les langages de parenthèses

This page was built for publication: Generalizations of regular sets and their application to a study of context-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4042672)