On the public citation graph
Control sets on grammars
0 signed · 128 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s0019-9958(59)90362-6openalex-snapshot
On certain formal properties of grammars
inferredcites →https://doi.org/10.1016/s0019-9958(60)90965-7openalex-snapshot
Note on the boolean properties of context free languages
inferredcites →https://doi.org/10.1016/s0019-9958(64)90406-1openalex-snapshot
A note on asymmetry in phrase structure grammars
inferredcites →https://doi.org/10.1016/s0019-9958(66)80016-5openalex-snapshot
Mappings which preserve context sensitive languages
inferredcites →https://doi.org/10.1016/s0019-9958(66)90211-7openalex-snapshot
Preservation of languages by transducers
inferredcites →https://doi.org/10.1090/s0002-9947-1964-0181500-1openalex-snapshot
Bounded 𝐴𝐿𝐺𝑂𝐿-like languages
inferredcites →https://doi.org/10.1109/focs.1967.28openalex-snapshot
Programmed grammars -- A new device for generating formal languages
inferredcites →https://doi.org/10.1109/tit.1956.1056813openalex-snapshot
Three models for the description of language
inferredcites →https://doi.org/10.1145/321250.321254openalex-snapshot
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_4openalex-snapshot
Grammars with dynamic control sets
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_10openalex-snapshot
About connections between syntactical and computational complexity
inferred← citeshttps://doi.org/10.1007/978-1-4471-0717-0_8openalex-snapshot
Even Linear Simple Matrix Languages: Formal Language Aspects
inferred← citeshttps://doi.org/10.1007/978-1-4939-0369-6_18openalex-snapshot
Chapter 18 Deep Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-1-4939-0369-6_6openalex-snapshot
Chapter 6 One-Sided Versions of Random Context Grammars
inferred← citeshttps://doi.org/10.1007/978-3-031-23612-9_10openalex-snapshot
A Myhill-Nerode Theorem for Finite State Matrix Automata and Finite Matrix Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-97274-4_3openalex-snapshot
Further Remarks on Context-Free Grammars with Subregular Control Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_9openalex-snapshot
Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_13openalex-snapshot
Grammars With Regulated Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-02674-4_6openalex-snapshot
A Language-Theoretic View on Guidelines and Consistency Rules of UML
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_39openalex-snapshot
A Sufficient Condition for Erasing Productions to Be Avoidable
inferred← citeshttps://doi.org/10.1007/978-3-642-31644-9_11openalex-snapshot
One-Sided Random Context Grammars with Leftmost Derivations
inferred← citeshttps://doi.org/10.1007/978-3-642-45321-2_6openalex-snapshot
Reactivity and Grammars: An Exploration
inferred← citeshttps://doi.org/10.1007/978-3-642-48908-2_1openalex-snapshot
Efficient non — Contextfree Parsing
inferred← citeshttps://doi.org/10.1007/978-3-642-70284-6_13openalex-snapshot
Zwei Schritte zur Verbesserung von PROLOG-Programmiersystemen: DB-Unterstützung und Meta-Interpreter
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_3openalex-snapshot
Grammars with Controlled Derivations
inferred← citeshttps://doi.org/10.1007/978-4-431-53868-4_15openalex-snapshot
Computing by Observing Changes
inferred← citeshttps://doi.org/10.1007/978-94-015-9634-3_23openalex-snapshot
Regularly Controlled Formal Power Series
inferred← citeshttps://doi.org/10.1007/bf00288653openalex-snapshot
Normal forms for context-sensitive grammars
inferred← citeshttps://doi.org/10.1007/bf00989668openalex-snapshot
Notes on canonical label languages
inferred← citeshttps://doi.org/10.1007/bf01069541openalex-snapshot
Semantic-context grammars and their properties. I
inferred← citeshttps://doi.org/10.1007/bf01303055openalex-snapshot
Pumping lemmas for the control language hierarchy
inferred← citeshttps://doi.org/10.1007/bf01694178openalex-snapshot
Images of AFL under certain families of homomorphisms
inferred← citeshttps://doi.org/10.1007/bf01704910openalex-snapshot
Iterated linear control and iterated one-turn pushdowns
inferred← citeshttps://doi.org/10.1007/bf01744305openalex-snapshot
Control sets on grammars using depth-first derivations
inferred← citeshttps://doi.org/10.1007/bf01744567openalex-snapshot
Some formal results about stratificational grammars and their relevance to linguistics
inferred← citeshttps://doi.org/10.1007/bf01768467openalex-snapshot
Size, index, and context-sensitivity of controlled partition grammars
inferred← citeshttps://doi.org/10.1007/bf01768484openalex-snapshot
A generalization of leftmost derivations
inferred← citeshttps://doi.org/10.1007/bf02242242openalex-snapshot
Some concepts for languages more powerful than context-free
inferred← citeshttps://doi.org/10.1007/bf02243565openalex-snapshot
Fast recognition of context-sensitive structures
inferred← citeshttps://doi.org/10.1007/bfb0016288openalex-snapshot
The OI-hierarchy is closed under control
inferred← citeshttps://doi.org/10.1007/bfb0028831openalex-snapshot
Iterated linear control and iterated one-turn pushdowns
inferred← citeshttps://doi.org/10.1007/s00224-007-9053-2openalex-snapshot
Storage Products and Linear Control of Derivations
inferred← citeshttps://doi.org/10.1007/s00236-018-0325-xopenalex-snapshot
Weighted iterated linear control
inferred← citeshttps://doi.org/10.1007/s002360050108openalex-snapshot
Unconditional transfer in regulated rewriting
inferred← citeshttps://doi.org/10.1007/s12046-018-0833-yopenalex-snapshot
Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90208-6openalex-snapshot
Grammatical inference for even linear languages based on control sets
inferred← citeshttps://doi.org/10.1016/0020-0255(72)90006-0openalex-snapshot
General formulation of formal grammars
inferred← citeshttps://doi.org/10.1016/0020-0255(75)90025-0openalex-snapshot
Characterization theorems on abstract families of transducers
inferred← citeshttps://doi.org/10.1016/0096-0551(89)90017-9openalex-snapshot
On context-free programmed grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90035-xopenalex-snapshot
One way finite visit automata
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90023-9openalex-snapshot
Linear indexed languages
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90099-5openalex-snapshot
Grammars, derivation modes and properties of indexed and type-0 languages
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90026-0openalex-snapshot
The OI-hierarchy is closed under control
inferred← citeshttps://doi.org/10.1016/b978-0-12-775260-0.50019-0openalex-snapshot
FRACTIONALLY FUZZY GRAMMARS WITH APPLICATION TO PATTERN RECOGNITION
inferred← citeshttps://doi.org/10.1016/j.ic.2009.03.002openalex-snapshot
On input-revolving deterministic and nondeterministic finite automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.040openalex-snapshot
Computing by observing: Simple systems and simple observers
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.009openalex-snapshot
Monotonically controlling right linear grammars with unknown behaviors to output a target string
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.051openalex-snapshot
Reducing control alphabet size for the control of right linear grammars with unknown behaviors
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114704openalex-snapshot
Remarks on context-free grammars with subregular control languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(69)90554-3openalex-snapshot
Probabilistic and weighted grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(70)90464-xopenalex-snapshot
Periodically time-variant context-free grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(72)90026-5openalex-snapshot
Probabilistic grammars and automata
inferred← citeshttps://doi.org/10.1016/s0019-9958(72)90287-2openalex-snapshot
Some restrictive devices for context-free grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(73)90237-4openalex-snapshot
Associate languages and derivational complexity of formal grammars and languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(73)90564-0openalex-snapshot
Periodic representation of equal matrix grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(73)90884-xopenalex-snapshot
Some remarks on state grammars and matrix grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(74)80062-8openalex-snapshot
An analysis of grammars by their derivation sets
inferred← citeshttps://doi.org/10.1016/s0019-9958(74)90864-xopenalex-snapshot
Control sets on linear grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(75)90106-0openalex-snapshot
TOL schemes and control sets
inferred← citeshttps://doi.org/10.1016/s0019-9958(75)90216-8openalex-snapshot
A universal context-free grammar
inferred← citeshttps://doi.org/10.1016/s0019-9958(76)90128-5openalex-snapshot
The structure generating function of some families of languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(76)90243-6openalex-snapshot
Right and left parses in phrase-structure grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(77)90308-4openalex-snapshot
Controlled iteration grammars and full hyper-AFL's
inferred← citeshttps://doi.org/10.1016/s0019-9958(77)90337-0openalex-snapshot
Extended controlled table L-arrays
inferred← citeshttps://doi.org/10.1016/s0022-0000(68)80009-1openalex-snapshot
Derivation-bounded languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(70)80020-4openalex-snapshot
Abstract families of processors
inferred← citeshttps://doi.org/10.1016/s0022-0000(70)80045-9openalex-snapshot
An hierarchy between context-free and context-sensitive languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(71)80024-7openalex-snapshot
AFL with the semilinear property
inferred← citeshttps://doi.org/10.1016/s0022-0000(75)80017-1openalex-snapshot
Two-way a-transducers and AFL
inferred← citeshttps://doi.org/10.1016/s0022-0000(77)80005-6openalex-snapshot
Theory of ω-languages. II: A study of various models of ω-type generation and recognition
inferred← citeshttps://doi.org/10.1016/s0022-0000(77)80012-3openalex-snapshot
Degree-languages: A new concept of acceptance
inferred← citeshttps://doi.org/10.1016/s0022-0000(77)80026-3openalex-snapshot
Control sets on context-free grammar forms
inferred← citeshttps://doi.org/10.1016/s0146-664x(76)80013-5openalex-snapshot
Hexagonal arrays and rectangular blocks
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00313-9openalex-snapshot
Even linear simple matrix languages: formal language properties and grammatical inference
inferred← citeshttps://doi.org/10.1023/a:1009924903938openalex-snapshot
On the Concatenation of One–Turn Pushdowns
inferred← citeshttps://doi.org/10.1023/a:1009954606346openalex-snapshot
Regulated Grammars under Leftmost Derivation
inferred← citeshttps://doi.org/10.1051/ita/2014007openalex-snapshot
Conditional Lindenmayer systems with subregular conditions: The non-extended case
inferred← citeshttps://doi.org/10.1080/00207167708803138openalex-snapshot
The complexity of the membership problem for some extensions of context-free languagest†
inferred← citeshttps://doi.org/10.1080/00207168908803717openalex-snapshot
Controlled bidirectional grammars
inferred← citeshttps://doi.org/10.1080/00207169408804310openalex-snapshot
Accepting grammars with regulation
inferred← citeshttps://doi.org/10.1093/comjnl/bxt125openalex-snapshot
Control Systems on Automata and Grammars
inferred← citeshttps://doi.org/10.1093/comjnl/bxx036openalex-snapshot
Deterministic Deep Pushdown Transducer and its Parallel Version
inferred← citeshttps://doi.org/10.1109/mahc.1981.10006openalex-snapshot
Formal Languages: Origins and Directions
inferred← citeshttps://doi.org/10.1109/sfcs.1979.19openalex-snapshot
Formal languages: Origins and directions
inferred← citeshttps://doi.org/10.1137/0201003openalex-snapshot
Terminal Context in Context-Sensitive Grammars
inferred← citeshttps://doi.org/10.1137/0206032openalex-snapshot
The Tape Comilexity of Some Classes of Szilard Languages
inferred← citeshttps://doi.org/10.1142/s0129054107004954openalex-snapshot
HYBRID EXTENDED FINITE AUTOMATA
inferred← citeshttps://doi.org/10.1142/s0129054107005364openalex-snapshot
DECISION PROBLEMS ON PATH-CONTROLLED GRAMMARS
inferred← citeshttps://doi.org/10.1145/321495.321504openalex-snapshot
Programmed Grammars and Classes of Formal Languages
inferred← citeshttps://doi.org/10.1145/360933.360969openalex-snapshot
Deterministic parsing of ambiguous grammars
inferred← citeshttps://doi.org/10.1145/512927.512928openalex-snapshot
Deterministic parsing of ambiguous grammars
inferred← citeshttps://doi.org/10.1145/800116.803763openalex-snapshot
Degree-languages, polynomial time recognition, and the LBA problem
inferred← citeshttps://doi.org/10.1145/800169.805415openalex-snapshot
Abstract families of processors
inferred← citeshttps://doi.org/10.25596/jalc-2009-175openalex-snapshot
Languages Generated by Context-Free Grammars Extended by Type AB → BA Rules
inferred← citeshttps://doi.org/10.3233/ifs-162138openalex-snapshot
Fuzzy state grammar and fuzzy deep pushdown automaton
inferred← citeshttps://doi.org/10.4204/eptcs.3.18openalex-snapshot
Capacity Bounded Grammars and Petri Nets
inferred← citeshttps://doi.org/10.70675/b835b3b3zae9dz4dbez8bfbzb0c92d36549bopenalex-snapshot
The control system in formal language theory and the model monitoring approach for reliability and safety
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.