Cognitive and sub-regular complexity

DOI10.1007/978-3-642-39998-5_6MaRDI QIDQ5327375zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cognitive complexitydescriptive complexityphonological stresssub-regular hierarchy

Mathematics Subject Classification ID

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

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

Cited in

(13)

• Separability by piecewise testable languages is \textsc{PTime}-complete
• Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
• Deterministic top-down tree automata with Boolean deterministic look-ahead
• Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
• Tractable competence
• On finding a first-order sentence consistent with a sample of strings
• scientific article; zbMATH DE number 3976852 (Why is no real title available?)
• Aural pattern recognition experiments and the subregular hierarchy
• MEASURING LANGUAGE
• scientific article; zbMATH DE number 7056230 (Why is no real title available?)
• Efficient learning of tier-based strictly k-local languages
• The expressivity of autosegmental grammars
• On the piecewise complexity of words

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)