Positive grammar checking: A finite state approach
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4068327
- A Finite-State Functional Grammar Architecture
- Verifying finite-state graph grammars: An unfolding-based approach
- Explicit State Model Checking for Graph Grammars
- scientific article; zbMATH DE number 4041294
- On state-alternating context-free grammars
- Compiling Linguistic Constraints into Finite State Automata
Cited in
(1)
This page was built for publication: Positive grammar checking: A finite state approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414163)