Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

80

CORR
2016
Springer

53views Education» more CORR 2016»

Complexity of regular abstractions of one-counter languages

9 years 11 months ago

Complexity of regular abstractions of one-counter languages

Download www.mpi-sws.org

Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofma

Real-time Traffic

CORR 2016 | Education |

claim paper

Related Content

» An Extendible Regular Expression Compiler for FiniteState Approaches in Natural Language P...

» Simplifying XML schema singletype approximations of regular tree languages

» Space Complexity vs Query Complexity

» A Case Study on GrammaticalBased Representation for Regular Expression Evolution

» Pumping and Counting on the Regular Post Embedding Problem

» On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory

» Complexity Results on Balanced ContextFree Languages

» Linear Time Logics Around PSL Complexity Expressiveness and a Little Bit of Succinctness

» Learning Regular Expressions from Noisy Sequences

» Some Reducibilities on Regular Sets

Post Info
More Details (n/a)

Added	31 Mar 2016
Updated	31 Mar 2016
Type	Journal
Year	2016
Where	CORR
Authors	Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche

Comments (0)