Detail publikace

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

HAVEL, M.; KŘIVKA, Z.; MEDUNA, A. How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars. Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications. Electronic Proceedings in Theoretical Computer Science, EPTCS. Göttingen: 2024. p. 87-100. ISSN: 2075-2180.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Havel Martin, Ing. (UIFS)
Křivka Zbyněk, Ing., Ph.D. (UIFS)
Meduna Alexandr, prof. RNDr., CSc. (UIFS)
URL
Rok
2024
Strany
87–100
Časopis
Electronic Proceedings in Theoretical Computer Science, EPTCS, roč. 407, ISSN 2075-2180
Sborník
Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications
Místo
Göttingen
DOI
10.4204/EPTCS.407.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"
}
Nahoru