Regulated Grammars and Automata
From MaRDI portal
Publication:5406167
DOI10.1007/978-1-4939-0369-6zbMath1410.68007OpenAlexW2397369732MaRDI QIDQ5406167
Publication date: 1 April 2014
Full work available at URL: https://doi.org/10.1007/978-1-4939-0369-6
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)
Related Items (14)
Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets ⋮ One-Sided Random Context Grammars: A Survey ⋮ Jumping Finite Automata: Characterizations and Complexity ⋮ A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model ⋮ The effect of jumping modes on various automata models ⋮ Unnamed Item ⋮ On Basic Properties of Jumping Finite Automata ⋮ Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete ⋮ Properties of right one-way jumping finite automata ⋮ Enhancement of automata with jumping modes ⋮ Improved descriptional complexity results on generalized forbidding grammars ⋮ On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness ⋮ Membership Problem for Two-Dimensional General Row Jumping Finite Automata ⋮ Decidability of Right One-Way Jumping Finite Automata
This page was built for publication: Regulated Grammars and Automata
