Recent trends in descriptional complexity of formal languages
From MaRDI portal
Publication:4967154
zbMATH Open1409.68161MaRDI QIDQ4967154FDOQ4967154
Authors: Martin Kutrib, Giovanni Pighizzini 
Publication date: 3 July 2019
Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/208/202
Recommendations
Cited In (13)
- Descriptional complexity of machines with limited resources
- Title not available (Why is that?)
- Descriptional complexity -- an introductory survey
- State complexity of permutation on finite languages over a binary alphabet
- State complexity of deletion and bipolar deletion
- Branching measures and nearly acyclic NFAs
- State complexity of suffix distance
- Structural properties of NFAs and growth rates of nondeterminism measures
- Operational state complexity of unary NFAs with finite nondeterminism
- State complexity of inversion operations
- State complexity of prefix distance
- State complexity of prefix distance
- Modern aspects of complexity within formal languages
This page was built for publication: Recent trends in descriptional complexity of formal languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967154)
