Detail publikace

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars

HAVEL, M. KŘIVKA, Z. MEDUNA, A.

Originální název

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Autoři

HAVEL, M.; KŘIVKA, Z.; MEDUNA, A.

Vydáno

12. 8. 2024

Místo

Göttingen

ISSN

2075-2180

Periodikum

Electronic Proceedings in Theoretical Computer Science, EPTCS

Ročník

407

Stát

neuvedeno

Strany od

87

Strany do

100

Strany počet

14

URL

https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?NCMA2024:3

BibTex

@inproceedings{BUT189042,
  author="Martin {Havel} and Zbyněk {Křivka} and Alexandr {Meduna}",
  title="How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars",
  booktitle="Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications",
  year="2024",
  journal="Electronic Proceedings in Theoretical Computer Science, EPTCS",
  volume="407",
  pages="87--100",
  address="Göttingen",
  doi="10.4204/EPTCS.407.3",
  issn="2075-2180",
  url="https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?NCMA2024:3"
}