Cognitive and Sub-regular Complexity

DOI10.1007/978-3-642-39998-5_6zbMath1377.68119OpenAlexW185028744MaRDI QIDQ5327375

No author found.

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

descriptive complexitycognitive complexityphonological stresssub-regular hierarchy

Mathematics Subject Classification ID

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

Related Items (8)

Deterministic top-down tree automata with Boolean deterministic look-ahead ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ Unnamed Item ⋮ The expressivity of autosegmental grammars ⋮ 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 ⋮ Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games ⋮ Unnamed Item

This page was built for publication: Cognitive and Sub-regular Complexity