Cognitive and sub-regular complexity

DOI10.1007/978-3-642-39998-5_6zbMATH Open1377.68119OpenAlexW185028744MaRDI QIDQ5327375FDOQ5327375

Authors:

Publication date: 7 August 2013

Published in: Formal Grammar (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39998-5_6

Recommendations

• scientific article; zbMATH DE number 3843141
• scientific article; zbMATH DE number 1560216
• scientific article; zbMATH DE number 3892611
• scientific article; zbMATH DE number 1502108
• Two complexity measures for context-free languages

zbMATH Keywords

descriptive complexitycognitive complexityphonological stresssub-regular hierarchy

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic of natural languages (03B65) Descriptive complexity and finite models (68Q19) Linguistics (91F20)

Cited In (12)

• Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
• Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
• Efficient learning of tier-based strictly \(k\)-local languages
• Aural pattern recognition experiments and the subregular hierarchy
• Tractable competence
• Title not available (Why is that?)
• Title not available (Why is that?)
• Separability by piecewise testable languages is \textsc{PTime}-complete
• Deterministic top-down tree automata with Boolean deterministic look-ahead
• The expressivity of autosegmental grammars
• Title not available (Why is that?)
• MEASURING LANGUAGE

This page was built for publication: Cognitive and sub-regular complexity

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