Generalizations of regular sets and their application to a study of context-free languages
From MaRDI portal
Publication:4042672
DOI10.1016/S0019-9958(75)90058-3zbMath0291.68031MaRDI QIDQ4042672
Publication date: 1975
Published in: Information and Control (Search for Journal in Brave)
Related Items (13)
The equivalence and inclusion problems for NTS languages ⋮ Unnamed Item ⋮ Conjunctive query containment over trees using schema information ⋮ Nest sets and relativized closure properties ⋮ Weighted monadic Datalog ⋮ THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES ⋮ Variants of top-down tree transducers with look-ahead ⋮ Attribute grammars for unranked trees as a query language for structured documents ⋮ Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata ⋮ Automata on finite trees ⋮ Generalized parenthesis languages and minimization of their parenthesis parts ⋮ Remarques sur les langages de parenthèses ⋮ Query automata over finite trees
This page was built for publication: Generalizations of regular sets and their application to a study of context-free languages
