Journal article 1256 views
DP lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation, Volume: 188, Issue: 1, Start page: 1
Swansea University Author: Faron Moller
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1016/S0890-5401(03)00171-8
Abstract
DP lower bounds for equivalence-checking and model-checking of one-counter automata
Published in: | Information and Computation |
---|---|
ISSN: | 0890-5401 |
Published: |
2004
|
Online Access: |
Check full text
|
URI: | https://cronfa.swan.ac.uk/Record/cronfa1719 |
first_indexed |
2013-07-23T11:48:12Z |
---|---|
last_indexed |
2018-02-09T04:29:14Z |
id |
cronfa1719 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2013-10-17T15:17:39.8050559</datestamp><bib-version>v2</bib-version><id>1719</id><entry>2011-10-01</entry><title>DP lower bounds for equivalence-checking and model-checking of one-counter automata</title><swanseaauthors><author><sid>bf25e0b52fe7c11c473cc48d306073f7</sid><ORCID>0000-0001-9535-8053</ORCID><firstname>Faron</firstname><surname>Moller</surname><name>Faron Moller</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2011-10-01</date><deptcode>MACS</deptcode><abstract></abstract><type>Journal Article</type><journal>Information and Computation</journal><volume>188</volume><journalNumber>1</journalNumber><paginationStart>1</paginationStart><paginationEnd/><publisher/><placeOfPublication/><issnPrint>0890-5401</issnPrint><issnElectronic/><keywords/><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2004</publishedYear><publishedDate>2004-12-31</publishedDate><doi>10.1016/S0890-5401(03)00171-8</doi><url/><notes/><college>COLLEGE NANME</college><department>Mathematics and Computer Science School</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>MACS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2013-10-17T15:17:39.8050559</lastEdited><Created>2011-10-01T00:00:00.0000000</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Petr</firstname><surname>Jančar</surname><order>1</order></author><author><firstname>Antonı́n</firstname><surname>Kučera</surname><order>2</order></author><author><firstname>Faron</firstname><surname>Moller</surname><orcid>0000-0001-9535-8053</orcid><order>3</order></author><author><firstname>Zdeněk</firstname><surname>Sawa</surname><order>4</order></author></authors><documents/><OutputDurs/></rfc1807> |
spelling |
2013-10-17T15:17:39.8050559 v2 1719 2011-10-01 DP lower bounds for equivalence-checking and model-checking of one-counter automata bf25e0b52fe7c11c473cc48d306073f7 0000-0001-9535-8053 Faron Moller Faron Moller true false 2011-10-01 MACS Journal Article Information and Computation 188 1 1 0890-5401 31 12 2004 2004-12-31 10.1016/S0890-5401(03)00171-8 COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University 2013-10-17T15:17:39.8050559 2011-10-01T00:00:00.0000000 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Petr Jančar 1 Antonı́n Kučera 2 Faron Moller 0000-0001-9535-8053 3 Zdeněk Sawa 4 |
title |
DP lower bounds for equivalence-checking and model-checking of one-counter automata |
spellingShingle |
DP lower bounds for equivalence-checking and model-checking of one-counter automata Faron Moller |
title_short |
DP lower bounds for equivalence-checking and model-checking of one-counter automata |
title_full |
DP lower bounds for equivalence-checking and model-checking of one-counter automata |
title_fullStr |
DP lower bounds for equivalence-checking and model-checking of one-counter automata |
title_full_unstemmed |
DP lower bounds for equivalence-checking and model-checking of one-counter automata |
title_sort |
DP lower bounds for equivalence-checking and model-checking of one-counter automata |
author_id_str_mv |
bf25e0b52fe7c11c473cc48d306073f7 |
author_id_fullname_str_mv |
bf25e0b52fe7c11c473cc48d306073f7_***_Faron Moller |
author |
Faron Moller |
author2 |
Petr Jančar Antonı́n Kučera Faron Moller Zdeněk Sawa |
format |
Journal article |
container_title |
Information and Computation |
container_volume |
188 |
container_issue |
1 |
container_start_page |
1 |
publishDate |
2004 |
institution |
Swansea University |
issn |
0890-5401 |
doi_str_mv |
10.1016/S0890-5401(03)00171-8 |
college_str |
Faculty of Science and Engineering |
hierarchytype |
|
hierarchy_top_id |
facultyofscienceandengineering |
hierarchy_top_title |
Faculty of Science and Engineering |
hierarchy_parent_id |
facultyofscienceandengineering |
hierarchy_parent_title |
Faculty of Science and Engineering |
department_str |
School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science |
document_store_str |
0 |
active_str |
0 |
published_date |
2004-12-31T06:06:06Z |
_version_ |
1821384446611292160 |
score |
11.048171 |