scientific article; zbMATH DE number 7347655

zbMath1503.68175MaRDI QIDQ4988164

Martin Kutrib, Friedrich Otto

Publication date: 12 May 2021

Full work available at URL: http://www.jalc.de/issues/2020/issue_25_2-3/jalc-2020-171-199.php

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decision problemclosure propertylocally testable languageeven linear languagelearnability in the limittwo-sided locally testable language

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (1)

On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN

Cites Work

• Learning regular sets from queries and counterexamples
• Grammatical inference for even linear languages based on control sets
• Lower bound technique for length-reducing automata
• On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
• Linear Context Free Languages
• Church-Rosser Thue systems and formal languages
• On 5′→3′ Sensing Watson-Crick Finite Automata
• On a family of linear grammars
• A machine realization of the linear context-free languages
• Language identification in the limit

This page was built for publication: