Forbidden patterns for ordered automata

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F20%3A00114579" target="_blank" >RIV/00216224:14310/20:00114579 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.jalc.de/issues/2020/issue_25_2-3/jalc-2020-141-169.php" target="_blank" >https://www.jalc.de/issues/2020/issue_25_2-3/jalc-2020-141-169.php</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.25596/jalc-2020-141" target="_blank" >10.25596/jalc-2020-141</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Forbidden patterns for ordered automata

Popis výsledku v původním jazyce

The contribution concerns decision procedures in the algebraic theory of regular lan-guages. Among others, various versions of forbidden patterns or configurations in automata are treated in the existing literature. Basically, one looks for certain subgraphs of the minimal automaton of a given language to decide whether this language does not belong to a given significant class of regular languages. We survey numerous known examples and we build a general theory covering the most of familiar ones. The chosen formalism differs from existing ones and the generalization to ordered automata enables us to reformulate some of known examples in a uniform shape. We also describe certain sufficient assumptions on the forbidden pattern which ensure that the corresponding class of languages forms a robust class in the sense of natural closure properties.

Název v anglickém jazyce

Forbidden patterns for ordered automata

Popis výsledku anglicky

The contribution concerns decision procedures in the algebraic theory of regular lan-guages. Among others, various versions of forbidden patterns or configurations in automata are treated in the existing literature. Basically, one looks for certain subgraphs of the minimal automaton of a given language to decide whether this language does not belong to a given significant class of regular languages. We survey numerous known examples and we build a general theory covering the most of familiar ones. The chosen formalism differs from existing ones and the generalization to ordered automata enables us to reformulate some of known examples in a uniform shape. We also describe certain sufficient assumptions on the forbidden pattern which ensure that the corresponding class of languages forms a robust class in the sense of natural closure properties.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA15-02862S" target="_blank" >GA15-02862S: Aplikace algebry a kombinatoriky v teorii formálních jazyků</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Automata, Languages and Combinatorics

ISSN

1430-189X

e-ISSN

—

Svazek periodika

25

Číslo periodika v rámci svazku

2-3

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

29

Strana od-do

141-169

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85089837623