4 papers
Language Approximation With One-Counter Automata
Alexander Sakharov
We present a method for approximating context-free languages with one-counter automata. This approximation allows the reconstruction of parse trees of the original grammar. We iden…
Data Language Specification via Terminal Attribution
Alexander Sakharov, Timothy Sakharov
Unstructured data have to be parsed in order to become usable. The complexity of grammar notations and the difficulty of grammar debugging limit the use of parsers for data preproc…
First-Order Intuitionistic Logic with Decidable Propositional Atoms
Alexander Sakharov
Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not co…
A Transformational Decision Procedure for Non-Clausal Propositional Formulas
Alexander Sakharov
A decision procedure for detecting valid propositional formulas is presented. It is based on the Davis-Putnam method and deals with propositional formulas that are initially conver…