scientific article; zbMATH DE number 4155910
From MaRDI portal
Publication:3484362
Recommendations
- scientific article; zbMATH DE number 68528
- Tightening the complexity of equivalence problems for commutative grammars
- scientific article; zbMATH DE number 777280
- The complexity of equivalence problems for commutative grammars
- A note on the equivalence and complexity of linear grammars
- REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE
- Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice
- scientific article; zbMATH DE number 4197438
- A really simple approximation of smallest grammar
- Algorithmic decidability of restricted ambiguity in context-free grammars
Cited in
(9)- Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
- Arithmetics properties of substitutions and infinite automata
- REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE
- Equivalence of Functions Represented by Simple Context-Free Grammars with Output
- An axiomatic approach to the Korenjak-Hopcroft algorithms
- scientific article; zbMATH DE number 3958760 (Why is no real title available?)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- A fast algorithm to decide on the equivalence of stateless DPDA
- Prime normal form and equivalence of simple grammars
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484362)
