Publication detail

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

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

Original Title

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

Type

article in a collection out of WoS and Scopus

Language

English

Authors

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

Released

12. 8. 2024

Location

Göttingen

ISBN

2075-2180

Periodical

Electronic Proceedings in Theoretical Computer Science, EPTCS

Year of study

407

State

unknown

Pages from

87

Pages to

100

Pages count

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"
}

Responsibility: Ing. Marek Strakoš