Forbidden patterns for ordered automata
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Forbidden patterns for ordered automata
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA15-02862S" target="_blank" >GA15-02862S: Applications of Algebra and Combinatorics in Formal Language Theory</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Automata, Languages and Combinatorics
ISSN
1430-189X
e-ISSN
—
Volume of the periodical
25
Issue of the periodical within the volume
2-3
Country of publishing house
DE - GERMANY
Number of pages
29
Pages from-to
141-169
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-85089837623