A Constraint Solving Approach to Parikh Images of Regular Languages
Abstract
References
Index Terms
- A Constraint Solving Approach to Parikh Images of Regular Languages
Recommendations
Parikh Images of Grammars: Complexity and Applications
LICS '10: Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer ScienceParikh’s Theorem states that semilinear sets are effectively equivalent with the Parikh images of regular languages and those of context-free languages. In this paper, we study the complexity of Parikh’s Theorem over any fixed alphabet size d. We prove ...
An SMT Solver for Regular Expressions and Linear Arithmetic over String Length
Computer Aided VerificationAbstractWe present a novel length-aware solving algorithm for the quantifier-free first-order theory over regex membership predicate and linear arithmetic over string length. We implement and evaluate this algorithm and related heuristics in the Z3 ...
Unambiguity in timed regular languages: automata and logics
FORMATS'10: Proceedings of the 8th international conference on Formal modeling and analysis of timed systemsUnambiguous languages (UL), originally defined by Schutzenberger using unambiguous polynomials, are a robust subclass of regular languages. They have many diverse characterizations: they are recognized by partially-ordered two-way deterministic automata ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Badges
Author Tags
Qualifiers
- Research-article
Funding Sources
- Vetenskapsrådet
- Vetenskapsrådet
- Swedish Foundation for Strategic Research
- Wallenberg Science Foundation
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 160Total Downloads
- Downloads (Last 12 months)160
- Downloads (Last 6 weeks)24
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in