Article

A Generalisation of Parikh's Theorem in Formal Language Theory

Author:

Jan van LeeuwenAuthors Info & Claims

Proceedings of the 2nd Colloquium on Automata, Languages and Programming

Pages 17 - 26

Published: 29 July 1974 Publication History

Abstract

No abstract available.

Cited By

View all

Abdulla PAtig MChen YDiep BHolík LRezine ARümmer P(2017)Flatten and conquer: a framework for efficient analysis of string constraintsACM SIGPLAN Notices10.1145/3140587.306238452:6(602-617)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3140587.3062384
Abdulla PAtig MChen YDiep BHolík LRezine ARümmer PCohen AVechev M(2017)Flatten and conquer: a framework for efficient analysis of string constraintsProceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3062341.3062384(602-617)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3062341.3062384
Drewes FEngelfriet J(2015)The generative power of delegation networksInformation and Computation10.1016/j.ic.2015.04.005245:C(213-258)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1016/j.ic.2015.04.005
Show More Cited By

Index Terms

A Generalisation of Parikh's Theorem in Formal Language Theory
1. Theory of computation
  1. Logic

Recommendations

Certain rational sets in formal language theory
A Bialgebraic Approach to Automata and Formal Language Theory
LFCS '09: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". In this paper, we apply the defining diagrams of algebras, coalgebras, and bialgebras to categories of ...
Parikh's Theorem in Commutative Kleene Algebra
LICS '99: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

Parikh's Theorem says that the commutative image of every context free language is the commutative image of some regular set. Pilling has shown that this theorem is essentially a statement about least solutions of polynomial inequalities. We prove the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Proceedings of the 2nd Colloquium on Automata, Languages and Programming

July 1974

611 pages

ISBN:3540068414

Editor:
Jacques Loeckx

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 29 July 1974

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Abdulla PAtig MChen YDiep BHolík LRezine ARümmer P(2017)Flatten and conquer: a framework for efficient analysis of string constraintsACM SIGPLAN Notices10.1145/3140587.306238452:6(602-617)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3140587.3062384
Abdulla PAtig MChen YDiep BHolík LRezine ARümmer PCohen AVechev M(2017)Flatten and conquer: a framework for efficient analysis of string constraintsProceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3062341.3062384(602-617)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3062341.3062384
Drewes FEngelfriet J(2015)The generative power of delegation networksInformation and Computation10.1016/j.ic.2015.04.005245:C(213-258)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1016/j.ic.2015.04.005
Esparza JGanty PKiefer SLuttenberger M(2011)Parikh's theoremInformation Processing Letters10.1016/j.ipl.2011.03.019111:12(614-619)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1016/j.ipl.2011.03.019
Xing H(2007)Fuzzy pushdown automataFuzzy Sets and Systems10.1016/j.fss.2007.01.012158:13(1437-1449)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1016/j.fss.2007.01.012
Asveld P(2005)Fuzzy context-free languagesTheoretical Computer Science10.1016/j.tcs.2005.06.012347:1-2(167-190)Online publication date: 30-Nov-2005
https://dl.acm.org/doi/10.1016/j.tcs.2005.06.012

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Certain rational sets in formal language theory

A Bialgebraic Approach to Automata and Formal Language Theory

Parikh's Theorem in Commutative Kleene Algebra

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations