Control sets on linear grammars

DOI10.1016/S0019-9958(74)90864-XMaRDI QIDQ4053132zbMATH OpenFDO

Authors Nabil A. Khabbaz

Publication date 1974

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(74)90864-X

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(14)

• Multipass precedence analysis
• The OI-hierarchy is closed under control
• Basic tree transducers
• Control sets on context-free grammar forms
• One way finite visit automata
• Tree transducers, L systems, and two-way machines
• Weighted parsing for grammar-based language models over multioperator monoids
• HYBRID EXTENDED FINITE AUTOMATA
• On input-revolving deterministic and nondeterministic finite automata
• Iterated linear control and iterated one-turn pushdowns
• Gaining Power by Input Operations: Finite Automata and Beyond
• scientific article; zbMATH DE number 3602690 (Why is no real title available?)
• Weighted iterated linear control
• Even linear simple matrix languages: formal language properties and grammatical inference.

This page was built for publication: Control sets on linear grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4053132)