Control sets on grammars
From MaRDI portal
Recommendations
Cites work
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- A note on asymmetry in phrase structure grammars
- Bounded Algol-Like Languages
- scientific article; zbMATH DE number 3174044 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3313290 (Why is no real title available?)
- Mappings which preserve context sensitive languages
- Note on the boolean properties of context free languages
- On certain formal properties of grammars
- One-way stack automata
- Preservation of languages by transducers
- Studies in abstract families of languages
- Three models for the description of language
- Two-way languages
Cited in
(59)- On input-revolving deterministic and nondeterministic finite automata
- Grammars, derivation modes and properties of indexed and type-0 languages
- The OI-hierarchy is closed under control
- Grammatical inference for even linear languages based on control sets
- Abstract grammars based on transductions
- Two-way A-transducers and AFL
- Interactive languages
- Uniformly erasable AFL
- Characterization theorems on abstract families of transducers
- Degree-languages: A new concept of acceptance
- Control sets on context-free grammar forms
- Theory of -languages. II: A study of various models of - type generation and recognition
- One way finite visit automata
- Fast recognition of context-sensitive structures
- Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets
- Normal forms for context-sensitive grammars
- Theory of formal grammars
- Even linear simple matrix languages: formal language properties and grammatical inference.
- On the generation of sentences with their parses by propagating regular-controlled grammars
- Reducing control alphabet size for the control of right linear grammars with unknown behaviors
- Monotonically controlling right linear grammars with unknown behaviors to output a target string
- Weighted iterated linear control
- Storage products and linear control of derivations
- Derivation-bounded languages
- A hierarchy between context-free and context-sensitive languages
- Abstract families of processors
- General formulation of formal grammars
- AFL with the semilinear property
- Some concepts for languages more powerful than context-free
- One-sided random context grammars with leftmost derivations
- Decision problems on path-controlled grammars
- HYBRID EXTENDED FINITE AUTOMATA
- Iterated linear control and iterated one-turn pushdowns
- scientific article; zbMATH DE number 4062631 (Why is no real title available?)
- Notes on canonical label languages
- Some formal results about stratificational grammars and their relevance to linguistics
- A generalization of leftmost derivations
- Size, index, and context-sensitivity of controlled partition grammars
- The complexity of the membership problem for some extensions of context-free languagest†
- Control sets on grammars using depth-first derivations
- scientific article; zbMATH DE number 1059896 (Why is no real title available?)
- scientific article; zbMATH DE number 1089086 (Why is no real title available?)
- scientific article; zbMATH DE number 1749214 (Why is no real title available?)
- Pumping lemmas for the control language hierarchy
- Accepting grammars with regulation
- A DEFINITION OF PARIKH CONTROLLED CONTEXT-FREE GRAMMARS AND SOME PROPERTIES OF THEM
- Relations between Control Mechanisms for Sequential Grammars1
- Fuzzy state grammar and fuzzy deep pushdown automaton
- Images of AFL under certain families of homomorphisms
- scientific article; zbMATH DE number 3393742 (Why is no real title available?)
- scientific article; zbMATH DE number 3194923 (Why is no real title available?)
- Basic tree transducers
- Computing by observing: simple systems and simple observers
- A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
- Workspace theorems for regular-controlled grammars
- Remarks on context-free grammars with subregular control languages
- Further remarks on context-free grammars with subregular control languages
- On the equality of grammatical families
- Linear indexed languages
This page was built for publication: Control sets on grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5539750)
