Even linear simple matrix languages: formal language properties and grammatical inference.

DOI10.1016/S0304-3975(01)00313-9zbMath1062.68065MaRDI QIDQ1853536

Henning Fernau

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

learningformal languagesgrammatical inferencecontrol languageKhabbaz hierarchieslanguage characterizationsMAT modelsimple matrix grammars

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Related Items (4)

Non-isometric Contextual Array Grammars with Regular Control and Local Selectors ⋮ Workspace theorems for regular-controlled grammars ⋮ Simple picture processing based on finite automata and regular grammars ⋮ Automatic learning from positive data and negative counterexamples

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the intersection of the class of linear context-free languages and the class of single-reset languages
• Learning regular sets from queries and counterexamples
• Inference of even linear grammars and its application to picture description languages
• Grammatical inference for even linear languages based on control sets
• Learning regular languages from counterexamples
• Learning semilinear sets from examples and via queries
• A geometric hierarchy beyond context-free languages
• A geometric hierarchy of languages
• One way finite visit automata
• The query complexity of learning DFA
• Learning deterministic even linear languages from positive examples
• When won't membership queries help?
• Asking questions to minimize errors
• Inference of finite automata using homing sequences
• A hierarchy of language families learnable by regular language learning
• The decidability of equivalence for a family of linear grammars
• Inference of Reversible Languages
• Left universal context-free grammars and homomorphic characterizations of languages
• Control sets on linear grammars
• A universal context-free grammar
• Image theorems for simple matrix languages andn-parallel languages
• A note on universal grammars
• A homomorphic representation of simple matrix languages
• Comments on universal and left universal grammars, context-sensitive languages, and context-free grammar forms
• Learning two-tape automata from queries and counterexamples
• On a family of linear grammars
• Finite-Turn Pushdown Automata
• A machine realization of the linear context-free languages
• Control sets on grammars
• On equal matrix languages
• On the entropy of context-free languages
• Simple matrix languages
• Unambiguous equal matrix languages
• Generalizations of regular events
• Language identification in the limit

This page was built for publication: Even linear simple matrix languages: formal language properties and grammatical inference.