A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions.
- Published in:
- Acta Informatica, 1997, v. 34, n. 5, p. 325, doi. 10.1007/s002360050087
- By:
- Publication type:
- Article
Works matching IS 00015903 AND DT 1997 AND VI 34 AND IP 5
Results: 5
1
2
Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs.
- Published in:
- Acta Informatica, 1997, v. 34, n. 5, p. 337, doi. 10.1007/s002360050088
- By:
- Publication type:
- Article
3
Implementing Daubechies wavelet transform with weighted finite automata.
- Published in:
- Acta Informatica, 1997, v. 34, n. 5, p. 347, doi. 10.1007/s002360050089
- By:
- Publication type:
- Article
4
Fundamentals of modelling concurrency using discrete relational structures.
- Published in:
- Acta Informatica, 1997, v. 34, n. 5, p. 367, doi. 10.1007/s002360050090
- By:
- Publication type:
- Article
5
A hierarchy of uniquely parsable grammar classes and deterministic acceptors.
- Published in:
- Acta Informatica, 1997, v. 34, n. 5, p. 389, doi. 10.1007/s002360050091
- By:
- Publication type:
- Article