Natural Language Engineering - Journal - Bridge of Knowledge

Natural Language Engineering

ISSN:

1351-3249

eISSN:

1469-8110

Disciplines
(Field of Science):

linguistics (Humanities)
architecture and urban planning (Engineering and Technology)
automation, electronics, electrical engineering and space technologies (Engineering and Technology)
information and communication technology (Engineering and Technology)
safety engineering (Engineering and Technology)
biomedical engineering (Engineering and Technology)
international relations (Social studies)
computer and information sciences (Natural sciences)

expand collapse

Ministry points: Help

Ministry points - current year
Year	Points	List
Year 2024	140	Ministry scored journals list 2024

expand collapse

Ministry points - previous years
Year	Points	List
2024	140	Ministry scored journals list 2024
2023	140	Ministry Scored Journals List
2022	140	Ministry Scored Journals List 2019-2022
2021	140	Ministry Scored Journals List 2019-2022
2020	140	Ministry Scored Journals List 2019-2022
2019	140	Ministry Scored Journals List 2019-2022
2018	20	A
2017	20	A
2016	20	A
2015	20	A
2014	20	A
2013	20	A
2012	12	C
2011	12	C

Model:

Open Access

Points CiteScore:

Points CiteScore - current year
Year	Points
Year 2023	5.9

expand collapse

Points CiteScore - previous years
Year	Points
2023	5.9
2022	5.5
2021	3.6
2020	3.8
2019	3.6
2018	2.8
2017	2.7
2016	2.5
2015	2.2
2014	2.4
2013	2.4
2012	2.9
2011	2.6

Impact Factor:

Log in to see the Impact Factor.

Sherpa Romeo:

https://v2.sherpa.ac.uk/id/publication/2144

Papers published in journal

results on page:
year:
- selected sort by year newest first
- sort by year oldest first
title:
- selected sort by title A-Z
- sort by title Z-A
citation:
- sort by citation descending
- sort by citation ascending

Filters

total: 1

Year 2003

An efficient incremental DFA minimization algorithm
Publication
- J. Daciuk
- B. W. Watson
- Natural Language Engineering - Year 2003
W tym artykule przedstawiamy nowy algorytm minimalizacji deterministycznego automatu skończonego. Algorytm jest przyrostowy - może być zatrzymany w dowolnym momencie, dając częściowo zminimalizowany automat. Wszystkie inne (znane) algorytmy minimalizacji dają wyniki pośrednie nieprzydatne dla częściowej minimalizacji. Ponieważ pierwszy algorytm jest łatwo zrozumiały ale mało wydajny, rozważamy trzy praktyczne, znaczące usprawnienia....

seen 561 times