. "2012-09-17+02:00"^^ . . . "[1904B37C6C0D]" . "RIV/00216208:11320/12:10130955" . . "Slovensk\u00E1 spolo\u010Dnos\u0165 pre umel\u00FA inteligenciu" . "978-80-971144-0-4" . "Information Technologies - Applications and Theory, Conference on Theory and Practice of Information Technologies, Proceedings" . . "Localization of (in)consistencies by monotone reducing automata"@en . "http://itat.ics.upjs.sk/proceedings/ITAT2012%20-%20CEUR%20Proceedings%20-%20tlacova%20verzia.pdf" . "P(GAP103/10/0783), P(GAP202/10/1333)" . "11320" . "monotony, DCFL, syntactic errors; reducing automata"@en . "Proch\u00E1zka, Martin" . "Pl\u00E1tek, Martin" . . "Ko\u0161ice, Slovakia" . "2"^^ . . "1"^^ . . "\u017Ddiar, Slovakia" . . "RIV/00216208:11320/12:10130955!RIV13-GA0-11320___" . . "A reducing automaton (red-automaton) is a deterministic automaton proposed for checking word and sub-word correctness by the use of analysis by reduction. Its monotone version characterizes the class of deterministic context-free languages (DCFL). We propose a method for a construction of a deterministic monotone enhancement of any monotone reducing automaton which is able with the help of special auxiliary symbols to localize its pre\uFB01x and post-pre\uFB01x (in)consistencies, and certain types of reducing con\uFB02icts. In other words this method ensures a robust analysis by reduction without spurious error messages. We formulate natural conditions for which this method ensures the localization of all pre\uFB01x and post-pre\uFB01x inconsistencies in any (incorrect) word with respect to a DCFL." . "Localization of (in)consistencies by monotone reducing automata"@en . . . . . "Localization of (in)consistencies by monotone reducing automata" . . "147325" . "A reducing automaton (red-automaton) is a deterministic automaton proposed for checking word and sub-word correctness by the use of analysis by reduction. Its monotone version characterizes the class of deterministic context-free languages (DCFL). We propose a method for a construction of a deterministic monotone enhancement of any monotone reducing automaton which is able with the help of special auxiliary symbols to localize its pre\uFB01x and post-pre\uFB01x (in)consistencies, and certain types of reducing con\uFB02icts. In other words this method ensures a robust analysis by reduction without spurious error messages. We formulate natural conditions for which this method ensures the localization of all pre\uFB01x and post-pre\uFB01x inconsistencies in any (incorrect) word with respect to a DCFL."@en . "8"^^ . . . "Localization of (in)consistencies by monotone reducing automata" . . .