The expressivity of autosegmental grammars
From MaRDI portal
Publication:667923
DOI10.1007/S10849-018-9270-XzbMath1477.68139OpenAlexW2803236906MaRDI QIDQ667923
Publication date: 4 March 2019
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10849-018-9270-x
Cites Work
- Aural pattern recognition experiments and the subregular hierarchy
- Classifying regular events in symbolic logic
- Context-free graph grammars and concatenation of graphs
- Dot-depth of star-free events
- Sentence and Word Complexity
- An Algebraic Characterization of Strictly Piecewise Languages
- A Course in Financial Calculus
- Weak Second‐Order Arithmetic and Finite Automata
- On Languages Piecewise Testable in the Strict Sense
- Algebraic decision procedures for local testability
- Cognitive and Sub-regular Complexity
- On finite monoids having only trivial subgroups
- Three models for the description of language
- Efficient Learning of Tier-Based Strictly k-Local Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The expressivity of autosegmental grammars