Abstract:
The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other. Our main result is d...Show MoreMetadata
Abstract:
The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other. Our main result is decidability, and PSPACE-completeness, of the regular separability problem for languages of one counter automata without zero tests (also known as one counter nets). This contrasts with undecidability of the regularity problem for one counter nets, and with undecidability of the regular separability problem for one counter automata, which is our second result.
Date of Conference: 20-23 June 2017
Date Added to IEEE Xplore: 10 August 2017
ISBN Information:
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Separation Problem ,
- Regularization Problem ,
- Regular Language ,
- Linear Equation ,
- Language Teaching ,
- Finite Set ,
- State Machine ,
- Decision Problem ,
- Word Length ,
- Proof Of Proposition ,
- Starting State ,
- Final Configuration ,
- Sequence Of Transitions ,
- Letters Of The Alphabet ,
- Linear Scheme ,
- Reachable Set ,
- Integer Vector ,
- Fresh State ,
- Counter Value ,
- Finite Union
Contents Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Separation Problem ,
- Regularization Problem ,
- Regular Language ,
- Linear Equation ,
- Language Teaching ,
- Finite Set ,
- State Machine ,
- Decision Problem ,
- Word Length ,
- Proof Of Proposition ,
- Starting State ,
- Final Configuration ,
- Sequence Of Transitions ,
- Letters Of The Alphabet ,
- Linear Scheme ,
- Reachable Set ,
- Integer Vector ,
- Fresh State ,
- Counter Value ,
- Finite Union
