@inproceedings{alur_back_1992,
	title = {Back to the {Future}: {Towards} a {Theory} of {Timed} {Regular} {Languages}},
	doi = {10.1109/SFCS.1992.267774},
	booktitle = {Proceedings of the 33rd {Annual} {Symposium} on {Foundations} of {Computer} {Science}},
	author = {Alur, Rajeev and Henzinger, Thomas A.},
	year = {1992},
	keywords = {Automata, Boolean functions, Computational modeling, Computer science, Contracts, Instruments, Logic, Military computing, PSPACE-complete, Robustness, Timing, boolean operations, deterministic automata, formal languages, temporal logic, theory of timed regular languages, two-way timed automata, undecidability},
	pages = {177--186}
}

{"_id":"xqkquBNH2KaJhQyEQ","bibbaseid":"alur-henzinger-backtothefuturetowardsatheoryoftimedregularlanguages-1992","authorIDs":[],"author_short":["Alur, R.","Henzinger, T. A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Back to the Future: Towards a Theory of Timed Regular Languages","doi":"10.1109/SFCS.1992.267774","booktitle":"Proceedings of the 33rd Annual Symposium on Foundations of Computer Science","author":[{"propositions":[],"lastnames":["Alur"],"firstnames":["Rajeev"],"suffixes":[]},{"propositions":[],"lastnames":["Henzinger"],"firstnames":["Thomas","A."],"suffixes":[]}],"year":"1992","keywords":"Automata, Boolean functions, Computational modeling, Computer science, Contracts, Instruments, Logic, Military computing, PSPACE-complete, Robustness, Timing, boolean operations, deterministic automata, formal languages, temporal logic, theory of timed regular languages, two-way timed automata, undecidability","pages":"177–186","bibtex":"@inproceedings{alur_back_1992,\n\ttitle = {Back to the {Future}: {Towards} a {Theory} of {Timed} {Regular} {Languages}},\n\tdoi = {10.1109/SFCS.1992.267774},\n\tbooktitle = {Proceedings of the 33rd {Annual} {Symposium} on {Foundations} of {Computer} {Science}},\n\tauthor = {Alur, Rajeev and Henzinger, Thomas A.},\n\tyear = {1992},\n\tkeywords = {Automata, Boolean functions, Computational modeling, Computer science, Contracts, Instruments, Logic, Military computing, PSPACE-complete, Robustness, Timing, boolean operations, deterministic automata, formal languages, temporal logic, theory of timed regular languages, two-way timed automata, undecidability},\n\tpages = {177--186}\n}\n\n","author_short":["Alur, R.","Henzinger, T. A."],"key":"alur_back_1992","id":"alur_back_1992","bibbaseid":"alur-henzinger-backtothefuturetowardsatheoryoftimedregularlanguages-1992","role":"author","urls":{},"keyword":["Automata","Boolean functions","Computational modeling","Computer science","Contracts","Instruments","Logic","Military computing","PSPACE-complete","Robustness","Timing","boolean operations","deterministic automata","formal languages","temporal logic","theory of timed regular languages","two-way timed automata","undecidability"],"downloads":0},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/tillhofmann","creationDate":"2019-12-09T14:42:18.238Z","downloads":0,"keywords":["automata","boolean functions","computational modeling","computer science","contracts","instruments","logic","military computing","pspace-complete","robustness","timing","boolean operations","deterministic automata","formal languages","temporal logic","theory of timed regular languages","two-way timed automata","undecidability"],"search_terms":["back","future","towards","theory","timed","regular","languages","alur","henzinger"],"title":"Back to the Future: Towards a Theory of Timed Regular Languages","year":1992,"dataSources":["9pYjFWPBodPyDyb7N"]}