Conservative groupoids recognize only regular languages (Q476161): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q70 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6375053 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
groupoid | |||
Property / zbMATH Keywords: groupoid / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
conservative algebra | |||
Property / zbMATH Keywords: conservative algebra / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algebraic automata theory | |||
Property / zbMATH Keywords: algebraic automata theory / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ic.2014.08.005 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1997591489 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Languages recognized by finite aperiodic groupoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite loops recognize exactly the regular open languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4470490 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4522406 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4817547 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4179852 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algebraic automata and context-free sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: First-order logic and star-free sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3774066 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial closure and unambiguous product / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4407441 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classifying regular events in symbolic logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: General context-free recognition in less than cubic time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Representation of undirected graphs by anticommutative conservative groupoids / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:36, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Conservative groupoids recognize only regular languages |
scientific article |
Statements
Conservative groupoids recognize only regular languages (English)
0 references
28 November 2014
0 references
groupoid
0 references
conservative algebra
0 references
algebraic automata theory
0 references