Reducing control alphabet size for the control of right linear grammars with unknown behaviors
From MaRDI portal
Publication:1998876
Recommendations
- Monotonically controlling right linear grammars with unknown behaviors to output a target string
- scientific article; zbMATH DE number 4096798
- Unconstrained optimal control of regular languages
- Control sets on grammars
- Grammatical inference for even linear languages based on control sets
- Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
- scientific article; zbMATH DE number 3907802
- On the size of unambiguous context-free grammars
- Robust optimal control of regular languages
- Operational complexity and right linear grammars
Cites work
- Computing with membranes
- Control sets on grammars
- Experimental validation and optimization of signal dependent operation in whiplash PCR
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- scientific article; zbMATH DE number 1241374 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Monotonically controlling right linear grammars with unknown behaviors to output a target string
- Periodically time-variant context-free grammars
- Programmed Grammars and Classes of Formal Languages
- Reaction systems
Cited in
(1)
This page was built for publication: Reducing control alphabet size for the control of right linear grammars with unknown behaviors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998876)